/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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 01:04:16,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 01:04:16,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 01:04:16,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 01:04:16,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 01:04:16,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 01:04:16,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 01:04:16,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 01:04:16,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 01:04:16,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 01:04:16,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 01:04:16,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 01:04:16,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 01:04:16,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 01:04:16,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 01:04:16,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 01:04:16,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 01:04:16,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 01:04:16,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 01:04:16,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 01:04:16,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 01:04:16,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 01:04:16,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 01:04:16,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 01:04:16,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 01:04:16,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 01:04:16,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 01:04:16,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 01:04:16,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 01:04:16,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 01:04:16,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 01:04:16,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 01:04:16,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 01:04:16,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 01:04:16,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 01:04:16,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 01:04:16,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 01:04:16,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 01:04:16,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 01:04:16,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 01:04:16,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 01:04:16,529 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2022-02-19 01:04:16,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 01:04:16,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 01:04:16,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 01:04:16,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 01:04:16,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 01:04:16,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 01:04:16,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 01:04:16,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 01:04:16,552 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 01:04:16,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 01:04:16,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 01:04:16,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 01:04:16,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 01:04:16,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 01:04:16,555 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 01:04:16,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 01:04:16,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 01:04:16,555 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-19 01:04:16,555 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-19 01:04:16,555 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-19 01:04:16,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 01:04:16,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 01:04:16,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 01:04:16,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-19 01:04:16,714 INFO L275 PluginConnector]: CDTParser initialized [2022-02-19 01:04:16,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-02-19 01:04:16,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21760a3c5/e1178eb6891b413688eb932efc3df99a/FLAG6f0151d92 [2022-02-19 01:04:17,209 INFO L306 CDTParser]: Found 1 translation units. [2022-02-19 01:04:17,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-02-19 01:04:17,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21760a3c5/e1178eb6891b413688eb932efc3df99a/FLAG6f0151d92 [2022-02-19 01:04:17,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21760a3c5/e1178eb6891b413688eb932efc3df99a [2022-02-19 01:04:17,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 01:04:17,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-19 01:04:17,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-19 01:04:17,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-19 01:04:17,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-19 01:04:17,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 01:04:17" (1/1) ... [2022-02-19 01:04:17,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4191629e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:17, skipping insertion in model container [2022-02-19 01:04:17,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 01:04:17" (1/1) ... [2022-02-19 01:04:17,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-19 01:04:17,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-19 01:04:18,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-02-19 01:04:18,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 01:04:18,233 INFO L203 MainTranslator]: Completed pre-run [2022-02-19 01:04:18,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-02-19 01:04:18,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 01:04:18,382 INFO L208 MainTranslator]: Completed translation [2022-02-19 01:04:18,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18 WrapperNode [2022-02-19 01:04:18,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-19 01:04:18,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 01:04:18,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 01:04:18,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 01:04:18,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,456 INFO L137 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2022-02-19 01:04:18,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 01:04:18,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 01:04:18,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 01:04:18,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 01:04:18,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 01:04:18,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 01:04:18,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 01:04:18,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 01:04:18,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (1/1) ... [2022-02-19 01:04:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 01:04:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:18,545 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-19 01:04:18,547 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-19 01:04:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-19 01:04:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-19 01:04:18,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-19 01:04:18,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-19 01:04:18,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-19 01:04:18,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-19 01:04:18,619 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-19 01:04:18,619 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-19 01:04:18,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-19 01:04:18,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 01:04:18,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 01:04:18,621 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 01:04:18,804 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 01:04:18,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 01:04:19,185 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 01:04:19,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 01:04:19,191 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2022-02-19 01:04:19,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 01:04:19 BoogieIcfgContainer [2022-02-19 01:04:19,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 01:04:19,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 01:04:19,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 01:04:19,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 01:04:19,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 01:04:17" (1/3) ... [2022-02-19 01:04:19,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d40f838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 01:04:19, skipping insertion in model container [2022-02-19 01:04:19,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 01:04:18" (2/3) ... [2022-02-19 01:04:19,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d40f838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 01:04:19, skipping insertion in model container [2022-02-19 01:04:19,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 01:04:19" (3/3) ... [2022-02-19 01:04:19,204 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2022-02-19 01:04:19,208 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 01:04:19,208 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 01:04:19,209 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-19 01:04:19,209 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 01:04:19,254 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,259 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,259 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,259 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,259 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,259 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,260 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,260 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,260 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,260 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,260 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,261 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,261 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,261 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,261 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,262 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,263 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,264 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,265 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 01:04:19,297 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-19 01:04:19,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 01:04:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:19,343 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-19 01:04:19,355 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-19 01:04:19,394 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-02-19 01:04:19,402 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-19 01:04:19,402 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-19 01:04:20,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1963515861, now seen corresponding path program 1 times [2022-02-19 01:04:20,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:20,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478915875] [2022-02-19 01:04:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-02-19 01:04:20,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:20,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478915875] [2022-02-19 01:04:20,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478915875] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 01:04:20,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 01:04:20,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 01:04:20,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194635613] [2022-02-19 01:04:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 01:04:20,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-19 01:04:20,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-19 01:04:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-19 01:04:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,265 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:20,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 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-19 01:04:20,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 01:04:20,285 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1969871598, now seen corresponding path program 1 times [2022-02-19 01:04:20,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:20,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181881978] [2022-02-19 01:04:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-02-19 01:04:20,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:20,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181881978] [2022-02-19 01:04:20,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181881978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 01:04:20,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 01:04:20,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 01:04:20,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032740460] [2022-02-19 01:04:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 01:04:20,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 01:04:20,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 01:04:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 01:04:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,431 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:20,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-19 01:04:20,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:20,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 01:04:20,502 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2007277458, now seen corresponding path program 1 times [2022-02-19 01:04:20,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:20,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401338775] [2022-02-19 01:04:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-02-19 01:04:20,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:20,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401338775] [2022-02-19 01:04:20,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401338775] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:04:20,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486197474] [2022-02-19 01:04:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:04:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:20,738 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-19 01:04:20,739 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-19 01:04:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:20,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-19 01:04:20,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:04:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2022-02-19 01:04:21,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-19 01:04:21,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486197474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 01:04:21,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-19 01:04:21,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-19 01:04:21,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706806499] [2022-02-19 01:04:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 01:04:21,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 01:04:21,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 01:04:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-19 01:04:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:21,623 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:21,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-19 01:04:21,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:21,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:21,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:21,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-19 01:04:21,986 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-19 01:04:21,986 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1942157376, now seen corresponding path program 1 times [2022-02-19 01:04:21,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:21,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512252731] [2022-02-19 01:04:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2022-02-19 01:04:22,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:22,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512252731] [2022-02-19 01:04:22,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512252731] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:04:22,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107538169] [2022-02-19 01:04:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:22,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:04:22,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:22,109 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-19 01:04:22,111 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-19 01:04:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:22,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 01:04:22,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:04:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2022-02-19 01:04:23,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 01:04:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2022-02-19 01:04:23,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107538169] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 01:04:23,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 01:04:23,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 01:04:23,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403946055] [2022-02-19 01:04:23,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 01:04:23,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 01:04:23,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 01:04:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 01:04:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:23,837 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:23,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 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-19 01:04:23,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:23,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:23,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:23,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:23,917 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-19 01:04:24,117 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-19 01:04:24,118 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -877946944, now seen corresponding path program 2 times [2022-02-19 01:04:24,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:24,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151894102] [2022-02-19 01:04:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 319 proven. 1 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2022-02-19 01:04:24,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:24,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151894102] [2022-02-19 01:04:24,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151894102] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:04:24,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840868475] [2022-02-19 01:04:24,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 01:04:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:04:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:24,294 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-19 01:04:24,330 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-19 01:04:24,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 01:04:24,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 01:04:24,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-19 01:04:24,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:04:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2022-02-19 01:04:25,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 01:04:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2081 trivial. 0 not checked. [2022-02-19 01:04:26,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840868475] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 01:04:26,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 01:04:26,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-02-19 01:04:26,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727940116] [2022-02-19 01:04:26,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 01:04:26,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-19 01:04:26,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-19 01:04:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-19 01:04:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:26,119 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:26,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 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-19 01:04:26,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:26,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:26,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:26,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:26,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-19 01:04:26,420 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-19 01:04:26,617 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-19 01:04:26,617 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2043992527, now seen corresponding path program 1 times [2022-02-19 01:04:26,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:26,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907060544] [2022-02-19 01:04:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-19 01:04:26,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:26,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907060544] [2022-02-19 01:04:26,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907060544] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:04:26,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746771221] [2022-02-19 01:04:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:26,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:04:26,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:26,797 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-19 01:04:26,804 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-19 01:04:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:26,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-19 01:04:26,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:04:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-19 01:04:27,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 01:04:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-19 01:04:27,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746771221] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 01:04:27,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 01:04:27,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-19 01:04:27,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981169042] [2022-02-19 01:04:27,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 01:04:27,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-19 01:04:27,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-19 01:04:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-19 01:04:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:27,473 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:27,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 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-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-19 01:04:27,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-19 01:04:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 01:04:27,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-19 01:04:27,923 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-19 01:04:27,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:04:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:04:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1157099697, now seen corresponding path program 2 times [2022-02-19 01:04:27,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:04:27,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390862271] [2022-02-19 01:04:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:04:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:04:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:04:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-19 01:04:29,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:04:29,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390862271] [2022-02-19 01:04:29,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390862271] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:04:29,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764411930] [2022-02-19 01:04:29,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 01:04:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:04:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:04:29,574 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-19 01:04:29,587 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-19 01:04:29,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 01:04:29,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 01:04:29,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-19 01:04:29,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:04:29,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-19 01:04:30,410 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-19 01:04:30,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-19 01:04:30,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-19 01:04:30,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-19 01:04:31,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-19 01:04:32,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-02-19 01:04:34,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-02-19 01:04:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-19 01:04:34,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 01:04:43,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1683)) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:43,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1683))) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:44,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1680)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1683))) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0))) is different from false [2022-02-19 01:04:44,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_1680)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_1683))) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:44,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (= (select (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) .cse0 v_ArrVal_1680)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681) |c_~#cache~0.base|) .cse0 v_ArrVal_1683)) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:45,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 2) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1680)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1683) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:45,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1683 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int) (v_ArrVal_1681 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 2) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1678))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1680))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1681) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1683) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) |c_~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76_117|))) is different from false [2022-02-19 01:04:48,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-19 01:04:48,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-02-19 01:04:48,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 114 [2022-02-19 01:04:48,884 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-19 01:04:48,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-19 01:04:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 13 not checked. [2022-02-19 01:04:48,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764411930] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 01:04:48,920 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 01:04:48,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 52 [2022-02-19 01:04:48,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919230786] [2022-02-19 01:04:48,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 01:04:48,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-02-19 01:04:48,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 01:04:48,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-02-19 01:04:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1735, Unknown=8, NotChecked=644, Total=2652 [2022-02-19 01:04:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:48,922 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 01:04:48,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.115384615384615) internal successors, (266), 52 states have internal predecessors, (266), 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-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-19 01:04:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-19 01:04:48,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:04:55,543 WARN L228 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 46 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:00,859 WARN L228 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 48 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:22,516 WARN L228 SmtUtils]: Spent 15.79s on a formula simplification. DAG size of input: 84 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:28,772 WARN L228 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 73 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:38,535 WARN L228 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 92 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:43,958 WARN L228 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 69 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-19 01:05:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 01:05:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-19 01:05:45,746 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-19 01:05:45,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:05:45,940 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-19 01:05:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 01:05:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -6258995, now seen corresponding path program 3 times [2022-02-19 01:05:45,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 01:05:45,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595905187] [2022-02-19 01:05:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 01:05:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 01:05:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 01:06:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-19 01:06:35,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 01:06:35,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595905187] [2022-02-19 01:06:35,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595905187] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 01:06:35,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475257124] [2022-02-19 01:06:35,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-19 01:06:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:06:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:06:35,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 01:06:35,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-19 01:06:35,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-19 01:06:35,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 01:06:35,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-19 01:06:35,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 01:06:35,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-19 01:06:36,591 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-19 01:06:36,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-19 01:06:36,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-19 01:06:37,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-19 01:06:37,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-02-19 01:06:55,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-19 01:07:04,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-19 01:08:19,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-19 01:08:27,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 01:08:27,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-19 01:08:27,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-02-19 01:08:27,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-19 01:08:31,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 01:08:31,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-19 01:08:31,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 01:08:31,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-19 01:08:31,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-19 01:08:36,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 01:08:36,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-19 01:08:41,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-19 01:10:28,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-02-19 01:10:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 106 refuted. 33 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-19 01:10:28,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 01:10:34,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_53| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_53| 28) |c_~#cache~0.offset|)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_53|)))) is different from false [2022-02-19 01:10:36,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_53| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_53| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-02-19 01:10:38,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|v_t_funThread1of1ForFork0_~i~0#1_53| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_53| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_53| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-02-19 01:10:39,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1861)) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:40,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1861))) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:40,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1861))) |c_~#cache~0.base|) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:40,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83|))) is different from false [2022-02-19 01:10:41,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 3)))) is different from false [2022-02-19 01:10:41,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0))) is different from false [2022-02-19 01:10:41,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1850)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:43,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| v_ArrVal_1850)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:44,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85| v_ArrVal_1850)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28))) is different from false [2022-02-19 01:10:44,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (= 0 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| |c_~#cache~0.offset| 1) v_ArrVal_1850)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28))) is different from false [2022-02-19 01:10:44,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (= 0 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| |c_~#cache~0.offset| 1) v_ArrVal_1850)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28))) is different from false [2022-02-19 01:10:46,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1847 Int) (v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1847)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| |c_~#cache~0.offset| 1) v_ArrVal_1850))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28))) is different from false [2022-02-19 01:10:50,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1847 Int) (v_ArrVal_1855 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (v_ArrVal_1850 Int) (v_ArrVal_1861 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 3)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| v_ArrVal_1847)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| |c_~#cache~0.offset| 1) v_ArrVal_1850))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1855) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| |c_~#cache~0.offset| 1) v_ArrVal_1861) (+ (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_85_113| 28))) is different from false Received shutdown request... [2022-02-19 01:18:40,985 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-19 01:18:40,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-19 01:18:40,993 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 01:18:41,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-19 01:18:41,017 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-19 01:18:41,017 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-19 01:18:41,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 01:18:41,204 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 38 for 6ms.. [2022-02-19 01:18:41,209 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-02-19 01:18:41,217 INFO L309 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2022-02-19 01:18:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 01:18:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 01:18:41,221 INFO L229 MonitoredProcess]: Starting monitored process 9 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-19 01:18:41,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-02-19 01:18:41,222 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 01:18:41,226 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-19 01:18:41,227 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-19 01:18:41,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-19 01:18:41,227 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2022-02-19 01:18:41,227 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-19 01:18:41,227 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-19 01:18:41,227 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-19 01:18:41,228 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-02-19 01:18:41,228 INFO L309 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2022-02-19 01:18:41,229 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 01:18:41,229 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 01:18:41,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 01:18:41 BasicIcfg [2022-02-19 01:18:41,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 01:18:41,231 INFO L158 Benchmark]: Toolchain (without parser) took 863631.87ms. Allocated memory was 185.6MB in the beginning and 675.3MB in the end (delta: 489.7MB). Free memory was 125.6MB in the beginning and 283.8MB in the end (delta: -158.2MB). Peak memory consumption was 330.6MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,231 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 01:18:41,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.14ms. Allocated memory was 185.6MB in the beginning and 250.6MB in the end (delta: 65.0MB). Free memory was 125.4MB in the beginning and 203.3MB in the end (delta: -77.9MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.47ms. Allocated memory is still 250.6MB. Free memory was 203.3MB in the beginning and 200.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,232 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 250.6MB. Free memory was 200.1MB in the beginning and 198.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,232 INFO L158 Benchmark]: RCFGBuilder took 686.73ms. Allocated memory is still 250.6MB. Free memory was 198.0MB in the beginning and 179.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,232 INFO L158 Benchmark]: TraceAbstraction took 862036.53ms. Allocated memory was 250.6MB in the beginning and 675.3MB in the end (delta: 424.7MB). Free memory was 178.6MB in the beginning and 283.8MB in the end (delta: -105.2MB). Peak memory consumption was 320.5MB. Max. memory is 8.0GB. [2022-02-19 01:18:41,233 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 185.6MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 782.14ms. Allocated memory was 185.6MB in the beginning and 250.6MB in the end (delta: 65.0MB). Free memory was 125.4MB in the beginning and 203.3MB in the end (delta: -77.9MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.47ms. Allocated memory is still 250.6MB. Free memory was 203.3MB in the beginning and 200.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 250.6MB. Free memory was 200.1MB in the beginning and 198.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 686.73ms. Allocated memory is still 250.6MB. Free memory was 198.0MB in the beginning and 179.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 862036.53ms. Allocated memory was 250.6MB in the beginning and 675.3MB in the end (delta: 424.7MB). Free memory was 178.6MB in the beginning and 283.8MB in the end (delta: -105.2MB). Peak memory consumption was 320.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31145, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 1545, negative conditional: 1430, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29764, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 164, negative conditional: 49, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29764, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 164, negative conditional: 49, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 1380, positive unconditional: 28220, negative: 181, negative conditional: 17, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 50, positive unconditional: 29550, negative: 181, negative conditional: 3, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 50, positive unconditional: 29550, negative: 181, negative conditional: 3, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14053, positive: 13936, positive conditional: 0, positive unconditional: 13936, negative: 117, negative conditional: 2, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14053, positive: 13857, positive conditional: 0, positive unconditional: 13857, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 117, negative conditional: 2, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 249, negative conditional: 5, negative unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29781, positive: 15664, positive conditional: 50, positive unconditional: 15614, negative: 64, negative conditional: 1, negative unconditional: 63, unknown: 14053, unknown conditional: 2, unknown unconditional: 14051] , Statistics on independence cache: Total cache size (in pairs): 14053, Positive cache size: 13936, Positive conditional cache size: 0, Positive unconditional cache size: 13936, Negative cache size: 117, Negative conditional cache size: 2, Negative unconditional cache size: 115, Eliminated conditions: 1344, Maximal queried relation: 1, Independence queries for same thread: 1381 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 788, Number of trivial persistent sets: 355, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26044, positive: 25929, positive conditional: 0, positive unconditional: 25929, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31145, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 1545, negative conditional: 1430, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29764, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 164, negative conditional: 49, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29764, positive: 29600, positive conditional: 3671, positive unconditional: 25929, negative: 164, negative conditional: 49, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 1380, positive unconditional: 28220, negative: 181, negative conditional: 17, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 50, positive unconditional: 29550, negative: 181, negative conditional: 3, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29781, positive: 29600, positive conditional: 50, positive unconditional: 29550, negative: 181, negative conditional: 3, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14053, positive: 13936, positive conditional: 0, positive unconditional: 13936, negative: 117, negative conditional: 2, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14053, positive: 13857, positive conditional: 0, positive unconditional: 13857, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 117, negative conditional: 2, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 249, negative conditional: 5, negative unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29781, positive: 15664, positive conditional: 50, positive unconditional: 15614, negative: 64, negative conditional: 1, negative unconditional: 63, unknown: 14053, unknown conditional: 2, unknown unconditional: 14051] , Statistics on independence cache: Total cache size (in pairs): 14053, Positive cache size: 13936, Positive conditional cache size: 0, Positive unconditional cache size: 13936, Negative cache size: 117, Negative conditional cache size: 2, Negative unconditional cache size: 115, Eliminated conditions: 1344, Maximal queried relation: 1, Independence queries for same thread: 1381 - 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 - 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: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence 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: 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: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 38 for 6ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 861.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 58.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 92, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 4232 NumberOfCodeBlocks, 4232 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5567 ConstructedInterpolants, 159 QuantifiedInterpolants, 21333 SizeOfPredicates, 42 NumberOfNonLiveVariables, 4089 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 17572/17988 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown