/usr/bin/java -Xmx16000000000 -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-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:06:55,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:06:55,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:06:55,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:06:55,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:06:55,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:06:55,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:06:55,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:06:55,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:06:55,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:06:55,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:06:55,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:06:55,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:06:55,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:06:55,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:06:55,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:06:55,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:06:55,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:06:55,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:06:55,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:06:55,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:06:55,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:06:55,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:06:55,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:06:55,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:06:55,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:06:55,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:06:55,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:06:55,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:06:55,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:06:55,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:06:55,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:06:55,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:06:55,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:06:55,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:06:55,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:06:55,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:06:55,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:06:55,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:06:55,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:06:55,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:06:55,364 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-PN-NoLbe-Before.epf [2022-01-19 06:06:55,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:06:55,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:06:55,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:06:55,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:06:55,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:06:55,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:06:55,397 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:06:55,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:06:55,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:06:55,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:06:55,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:06:55,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:06:55,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:06:55,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:06:55,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:06:55,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:06:55,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:06:55,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:06:55,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:06:55,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:06:55,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:06:55,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:06:55,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:06:55,401 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:06:55,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:06:55,402 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:06:55,402 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-01-19 06:06:55,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:06:55,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:06:55,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:06:55,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:06:55,660 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:06:55,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-01-19 06:06:55,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ec322d5/dee4e11c2e8a4a17a831e56e86c092fd/FLAG3bc579e70 [2022-01-19 06:06:56,188 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:06:56,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-01-19 06:06:56,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ec322d5/dee4e11c2e8a4a17a831e56e86c092fd/FLAG3bc579e70 [2022-01-19 06:06:56,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ec322d5/dee4e11c2e8a4a17a831e56e86c092fd [2022-01-19 06:06:56,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:06:56,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:06:56,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:06:56,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:06:56,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:06:56,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:06:56" (1/1) ... [2022-01-19 06:06:56,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b96d418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:56, skipping insertion in model container [2022-01-19 06:06:56,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:06:56" (1/1) ... [2022-01-19 06:06:56,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:06:56,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:06:57,025 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_70-funloop_racefree.i[41323,41336] [2022-01-19 06:06:57,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:06:57,066 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:06:57,105 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_70-funloop_racefree.i[41323,41336] [2022-01-19 06:06:57,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:06:57,156 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:06:57,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57 WrapperNode [2022-01-19 06:06:57,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:06:57,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:06:57,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:06:57,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:06:57,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,211 INFO L137 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-01-19 06:06:57,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:06:57,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:06:57,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:06:57,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:06:57,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:06:57,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:06:57,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:06:57,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:06:57,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (1/1) ... [2022-01-19 06:06:57,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:06:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:06:57,253 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-01-19 06:06:57,279 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-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:06:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:06:57,303 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:06:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:06:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:06:57,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:06:57,305 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:06:57,446 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:06:57,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:06:57,680 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:06:57,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:06:57,689 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-01-19 06:06:57,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:06:57 BoogieIcfgContainer [2022-01-19 06:06:57,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:06:57,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:06:57,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:06:57,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:06:57,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:06:56" (1/3) ... [2022-01-19 06:06:57,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e692e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:06:57, skipping insertion in model container [2022-01-19 06:06:57,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:06:57" (2/3) ... [2022-01-19 06:06:57,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e692e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:06:57, skipping insertion in model container [2022-01-19 06:06:57,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:06:57" (3/3) ... [2022-01-19 06:06:57,699 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-01-19 06:06:57,703 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:06:57,704 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:06:57,704 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:06:57,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,765 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-01-19 06:06:57,766 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-01-19 06:06:57,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,766 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-01-19 06:06:57,766 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-01-19 06:06:57,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 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-01-19 06:06:57,772 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-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,772 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-01-19 06:06:57,773 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-01-19 06:06:57,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,818 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-01-19 06:06:57,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,819 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-01-19 06:06:57,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:06:57,825 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:06:57,876 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:06:57,884 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:06:57,884 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:06:57,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 200 transitions, 408 flow [2022-01-19 06:06:58,007 INFO L129 PetriNetUnfolder]: 49/284 cut-off events. [2022-01-19 06:06:58,007 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:06:58,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 284 events. 49/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1023 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2022-01-19 06:06:58,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 200 transitions, 408 flow [2022-01-19 06:06:58,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 195 transitions, 395 flow [2022-01-19 06:06:58,080 INFO L129 PetriNetUnfolder]: 24/188 cut-off events. [2022-01-19 06:06:58,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:06:58,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:06:58,081 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:06:58,081 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:06:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:06:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 368299820, now seen corresponding path program 1 times [2022-01-19 06:06:58,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:06:58,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767686006] [2022-01-19 06:06:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:58,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:06:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:58,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:06:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767686006] [2022-01-19 06:06:58,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767686006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:06:58,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:06:58,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:06:58,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142311628] [2022-01-19 06:06:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:06:58,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:06:58,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:06:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:06:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:06:58,330 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 200 [2022-01-19 06:06:58,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 195 transitions, 395 flow. Second operand has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 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-01-19 06:06:58,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:06:58,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 200 [2022-01-19 06:06:58,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:06:58,375 INFO L129 PetriNetUnfolder]: 7/235 cut-off events. [2022-01-19 06:06:58,375 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:06:58,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 235 events. 7/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 780 event pairs, 0 based on Foata normal form. 41/262 useless extension candidates. Maximal degree in co-relation 134. Up to 4 conditions per place. [2022-01-19 06:06:58,378 INFO L132 encePairwiseOnDemand]: 173/200 looper letters, 1 selfloop transitions, 0 changer transitions 0/166 dead transitions. [2022-01-19 06:06:58,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 339 flow [2022-01-19 06:06:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:06:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:06:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-01-19 06:06:58,394 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.915 [2022-01-19 06:06:58,394 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-01-19 06:06:58,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-01-19 06:06:58,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:06:58,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-01-19 06:06:58,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 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-01-19 06:06:58,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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-01-19 06:06:58,409 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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-01-19 06:06:58,411 INFO L186 Difference]: Start difference. First operand has 166 places, 195 transitions, 395 flow. Second operand 2 states and 366 transitions. [2022-01-19 06:06:58,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 339 flow [2022-01-19 06:06:58,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:06:58,416 INFO L242 Difference]: Finished difference. Result has 165 places, 166 transitions, 337 flow [2022-01-19 06:06:58,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=337, PETRI_PLACES=165, PETRI_TRANSITIONS=166} [2022-01-19 06:06:58,421 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, -1 predicate places. [2022-01-19 06:06:58,422 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 166 transitions, 337 flow [2022-01-19 06:06:58,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 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-01-19 06:06:58,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:06:58,422 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:06:58,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:06:58,429 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:06:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:06:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 579650733, now seen corresponding path program 1 times [2022-01-19 06:06:58,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:06:58,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625673445] [2022-01-19 06:06:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:58,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:06:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:58,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:06:58,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625673445] [2022-01-19 06:06:58,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625673445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:06:58,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:06:58,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:06:58,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652813828] [2022-01-19 06:06:58,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:06:58,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:06:58,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:06:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:06:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:06:58,491 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:06:58,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 166 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-19 06:06:58,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:06:58,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:06:58,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:06:58,531 INFO L129 PetriNetUnfolder]: 7/239 cut-off events. [2022-01-19 06:06:58,531 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:06:58,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 239 events. 7/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 254. Up to 9 conditions per place. [2022-01-19 06:06:58,533 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 10 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-01-19 06:06:58,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 369 flow [2022-01-19 06:06:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:06:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:06:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-01-19 06:06:58,536 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667 [2022-01-19 06:06:58,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-01-19 06:06:58,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-01-19 06:06:58,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:06:58,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-01-19 06:06:58,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-01-19 06:06:58,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-01-19 06:06:58,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-01-19 06:06:58,540 INFO L186 Difference]: Start difference. First operand has 165 places, 166 transitions, 337 flow. Second operand 3 states and 499 transitions. [2022-01-19 06:06:58,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 369 flow [2022-01-19 06:06:58,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:06:58,546 INFO L242 Difference]: Finished difference. Result has 168 places, 167 transitions, 349 flow [2022-01-19 06:06:58,546 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2022-01-19 06:06:58,547 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 2 predicate places. [2022-01-19 06:06:58,547 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 349 flow [2022-01-19 06:06:58,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-19 06:06:58,548 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:06:58,548 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:06:58,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:06:58,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:06:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:06:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2047885968, now seen corresponding path program 1 times [2022-01-19 06:06:58,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:06:58,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971292978] [2022-01-19 06:06:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:58,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:06:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:58,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:06:58,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971292978] [2022-01-19 06:06:58,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971292978] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:06:58,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005215891] [2022-01-19 06:06:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:58,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:06:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:06:58,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:06:58,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:06:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:58,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:06:58,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:06:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:06:58,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:06:58,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005215891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:06:58,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:06:58,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:06:58,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893007734] [2022-01-19 06:06:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:06:58,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:06:58,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:06:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:06:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:06:58,886 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:06:58,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 167 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-19 06:06:58,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:06:58,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:06:58,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:06:58,926 INFO L129 PetriNetUnfolder]: 5/174 cut-off events. [2022-01-19 06:06:58,927 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:06:58,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 174 events. 5/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 364 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 192. Up to 6 conditions per place. [2022-01-19 06:06:58,929 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 8 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2022-01-19 06:06:58,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 169 transitions, 373 flow [2022-01-19 06:06:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:06:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:06:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-01-19 06:06:58,932 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8283333333333334 [2022-01-19 06:06:58,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-01-19 06:06:58,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-01-19 06:06:58,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:06:58,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-01-19 06:06:58,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-01-19 06:06:58,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-01-19 06:06:58,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-01-19 06:06:58,944 INFO L186 Difference]: Start difference. First operand has 168 places, 167 transitions, 349 flow. Second operand 3 states and 497 transitions. [2022-01-19 06:06:58,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 169 transitions, 373 flow [2022-01-19 06:06:58,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 169 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:06:58,951 INFO L242 Difference]: Finished difference. Result has 170 places, 167 transitions, 355 flow [2022-01-19 06:06:58,952 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2022-01-19 06:06:58,954 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 4 predicate places. [2022-01-19 06:06:58,955 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 355 flow [2022-01-19 06:06:58,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-19 06:06:58,955 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:06:58,956 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:06:58,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:06:59,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:06:59,184 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:06:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:06:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1088874387, now seen corresponding path program 1 times [2022-01-19 06:06:59,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:06:59,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124917820] [2022-01-19 06:06:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:59,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:06:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:59,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:06:59,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124917820] [2022-01-19 06:06:59,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124917820] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:06:59,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092984291] [2022-01-19 06:06:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:59,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:06:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:06:59,251 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-01-19 06:06:59,257 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-01-19 06:06:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:59,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:06:59,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:06:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:59,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:06:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:59,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092984291] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:06:59,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:06:59,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:06:59,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359149966] [2022-01-19 06:06:59,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:06:59,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:06:59,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:06:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:06:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:06:59,536 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:06:59,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 355 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 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-01-19 06:06:59,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:06:59,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:06:59,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:06:59,618 INFO L129 PetriNetUnfolder]: 5/181 cut-off events. [2022-01-19 06:06:59,618 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:06:59,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 181 events. 5/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 361 event pairs, 0 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2022-01-19 06:06:59,631 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/177 dead transitions. [2022-01-19 06:06:59,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 417 flow [2022-01-19 06:06:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:06:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:06:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-01-19 06:06:59,635 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-01-19 06:06:59,636 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-01-19 06:06:59,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-01-19 06:06:59,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:06:59,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-01-19 06:06:59,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 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-01-19 06:06:59,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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-01-19 06:06:59,642 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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-01-19 06:06:59,642 INFO L186 Difference]: Start difference. First operand has 170 places, 167 transitions, 355 flow. Second operand 9 states and 1471 transitions. [2022-01-19 06:06:59,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 417 flow [2022-01-19 06:06:59,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 177 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:06:59,659 INFO L242 Difference]: Finished difference. Result has 179 places, 173 transitions, 401 flow [2022-01-19 06:06:59,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=401, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2022-01-19 06:06:59,660 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places. [2022-01-19 06:06:59,661 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 401 flow [2022-01-19 06:06:59,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 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-01-19 06:06:59,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:06:59,662 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:06:59,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:06:59,862 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,SelfDestructingSolverStorable3 [2022-01-19 06:06:59,863 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:06:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:06:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 592594355, now seen corresponding path program 2 times [2022-01-19 06:06:59,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:06:59,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555060836] [2022-01-19 06:06:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:06:59,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:06:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:06:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:06:59,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:06:59,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555060836] [2022-01-19 06:06:59,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555060836] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:06:59,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928702632] [2022-01-19 06:06:59,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:06:59,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:06:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:07:00,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:07:00,007 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-01-19 06:07:00,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 06:07:00,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:07:00,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:07:00,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:07:00,182 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-01-19 06:07:00,394 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:07:00,395 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-01-19 06:07:00,450 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-01-19 06:07:00,568 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 14 treesize of output 10 [2022-01-19 06:07:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:07:00,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:07:00,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928702632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:07:00,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:07:00,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-01-19 06:07:00,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338405881] [2022-01-19 06:07:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:07:00,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 06:07:00,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:07:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 06:07:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:07:00,653 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 200 [2022-01-19 06:07:00,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 401 flow. Second operand has 12 states, 12 states have (on average 128.33333333333334) internal successors, (1540), 12 states have internal predecessors, (1540), 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-01-19 06:07:00,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:07:00,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 200 [2022-01-19 06:07:00,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:07:01,354 INFO L129 PetriNetUnfolder]: 814/3117 cut-off events. [2022-01-19 06:07:01,355 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 06:07:01,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 3117 events. 814/3117 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 26761 event pairs, 27 based on Foata normal form. 0/2933 useless extension candidates. Maximal degree in co-relation 4508. Up to 472 conditions per place. [2022-01-19 06:07:01,428 INFO L132 encePairwiseOnDemand]: 183/200 looper letters, 140 selfloop transitions, 34 changer transitions 0/303 dead transitions. [2022-01-19 06:07:01,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 303 transitions, 1009 flow [2022-01-19 06:07:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 06:07:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 06:07:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2065 transitions. [2022-01-19 06:07:01,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6883333333333334 [2022-01-19 06:07:01,449 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2065 transitions. [2022-01-19 06:07:01,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2065 transitions. [2022-01-19 06:07:01,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:07:01,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2065 transitions. [2022-01-19 06:07:01,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 137.66666666666666) internal successors, (2065), 15 states have internal predecessors, (2065), 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-01-19 06:07:01,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 states have internal predecessors, (3200), 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-01-19 06:07:01,462 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 states have internal predecessors, (3200), 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-01-19 06:07:01,463 INFO L186 Difference]: Start difference. First operand has 179 places, 173 transitions, 401 flow. Second operand 15 states and 2065 transitions. [2022-01-19 06:07:01,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 303 transitions, 1009 flow [2022-01-19 06:07:01,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 303 transitions, 1003 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 06:07:01,469 INFO L242 Difference]: Finished difference. Result has 203 places, 203 transitions, 625 flow [2022-01-19 06:07:01,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=625, PETRI_PLACES=203, PETRI_TRANSITIONS=203} [2022-01-19 06:07:01,470 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 37 predicate places. [2022-01-19 06:07:01,470 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 625 flow [2022-01-19 06:07:01,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 128.33333333333334) internal successors, (1540), 12 states have internal predecessors, (1540), 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-01-19 06:07:01,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:07:01,471 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:07:01,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:07:01,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:01,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:07:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:07:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash -733743385, now seen corresponding path program 1 times [2022-01-19 06:07:01,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:07:01,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060758076] [2022-01-19 06:07:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:01,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:07:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:07:01,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:07:01,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060758076] [2022-01-19 06:07:01,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060758076] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:07:01,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708653374] [2022-01-19 06:07:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:01,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:07:01,822 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-01-19 06:07:01,824 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-01-19 06:07:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:01,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:07:01,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:07:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:07:02,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:07:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:07:02,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708653374] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:07:02,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:07:02,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:07:02,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345757444] [2022-01-19 06:07:02,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:07:02,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:07:02,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:07:02,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:07:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:07:02,385 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 200 [2022-01-19 06:07:02,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 625 flow. Second operand has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 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-01-19 06:07:02,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:07:02,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 200 [2022-01-19 06:07:02,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:07:02,613 INFO L129 PetriNetUnfolder]: 9/325 cut-off events. [2022-01-19 06:07:02,614 INFO L130 PetriNetUnfolder]: For 47/55 co-relation queries the response was YES. [2022-01-19 06:07:02,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 325 events. 9/325 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 680 event pairs, 1 based on Foata normal form. 11/325 useless extension candidates. Maximal degree in co-relation 503. Up to 13 conditions per place. [2022-01-19 06:07:02,616 INFO L132 encePairwiseOnDemand]: 189/200 looper letters, 24 selfloop transitions, 25 changer transitions 3/145 dead transitions. [2022-01-19 06:07:02,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 145 transitions, 569 flow [2022-01-19 06:07:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:07:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:07:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3903 transitions. [2022-01-19 06:07:02,625 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7806 [2022-01-19 06:07:02,625 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3903 transitions. [2022-01-19 06:07:02,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3903 transitions. [2022-01-19 06:07:02,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:07:02,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3903 transitions. [2022-01-19 06:07:02,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 156.12) internal successors, (3903), 25 states have internal predecessors, (3903), 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-01-19 06:07:02,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 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-01-19 06:07:02,648 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 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-01-19 06:07:02,648 INFO L186 Difference]: Start difference. First operand has 203 places, 203 transitions, 625 flow. Second operand 25 states and 3903 transitions. [2022-01-19 06:07:02,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 145 transitions, 569 flow [2022-01-19 06:07:02,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 145 transitions, 549 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-01-19 06:07:02,653 INFO L242 Difference]: Finished difference. Result has 159 places, 129 transitions, 478 flow [2022-01-19 06:07:02,654 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=478, PETRI_PLACES=159, PETRI_TRANSITIONS=129} [2022-01-19 06:07:02,654 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, -7 predicate places. [2022-01-19 06:07:02,654 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 129 transitions, 478 flow [2022-01-19 06:07:02,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 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-01-19 06:07:02,656 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:07:02,656 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:07:02,702 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-01-19 06:07:02,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:02,868 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:07:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:07:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1355400681, now seen corresponding path program 1 times [2022-01-19 06:07:02,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:07:02,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268238906] [2022-01-19 06:07:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:02,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:07:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:07:03,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:07:03,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268238906] [2022-01-19 06:07:03,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268238906] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:07:03,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220283242] [2022-01-19 06:07:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:03,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:07:03,001 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-01-19 06:07:03,003 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-01-19 06:07:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:03,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:07:03,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:07:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:07:03,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:07:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:07:03,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220283242] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:07:03,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:07:03,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:07:03,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284912755] [2022-01-19 06:07:03,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:07:03,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:07:03,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:07:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:07:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:07:03,365 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:07:03,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 129 transitions, 478 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 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-01-19 06:07:03,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:07:03,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:07:03,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:07:03,583 INFO L129 PetriNetUnfolder]: 9/325 cut-off events. [2022-01-19 06:07:03,583 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:07:03,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 325 events. 9/325 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 597 event pairs, 1 based on Foata normal form. 3/322 useless extension candidates. Maximal degree in co-relation 564. Up to 17 conditions per place. [2022-01-19 06:07:03,584 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/155 dead transitions. [2022-01-19 06:07:03,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 155 transitions, 734 flow [2022-01-19 06:07:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:07:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:07:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-01-19 06:07:03,591 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-01-19 06:07:03,591 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-01-19 06:07:03,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-01-19 06:07:03,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:07:03,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-01-19 06:07:03,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 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-01-19 06:07:03,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 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-01-19 06:07:03,607 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 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-01-19 06:07:03,607 INFO L186 Difference]: Start difference. First operand has 159 places, 129 transitions, 478 flow. Second operand 30 states and 4888 transitions. [2022-01-19 06:07:03,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 155 transitions, 734 flow [2022-01-19 06:07:03,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 155 transitions, 698 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:07:03,611 INFO L242 Difference]: Finished difference. Result has 180 places, 139 transitions, 600 flow [2022-01-19 06:07:03,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=600, PETRI_PLACES=180, PETRI_TRANSITIONS=139} [2022-01-19 06:07:03,612 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 14 predicate places. [2022-01-19 06:07:03,612 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 139 transitions, 600 flow [2022-01-19 06:07:03,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 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-01-19 06:07:03,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:07:03,614 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:07:03,632 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-01-19 06:07:03,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:03,827 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:07:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:07:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2046255230, now seen corresponding path program 2 times [2022-01-19 06:07:03,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:07:03,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906505118] [2022-01-19 06:07:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:03,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:07:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:07:04,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:07:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906505118] [2022-01-19 06:07:04,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906505118] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:07:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211809195] [2022-01-19 06:07:04,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:07:04,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:07:04,180 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-01-19 06:07:04,181 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-01-19 06:07:04,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:07:04,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:07:04,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:07:04,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:07:04,297 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-01-19 06:07:04,591 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:07:04,592 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-01-19 06:07:04,624 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-01-19 06:07:04,716 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 14 treesize of output 10 [2022-01-19 06:07:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:07:04,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:07:12,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_230 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_230) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:07:13,546 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 9 treesize of output 7 [2022-01-19 06:07:13,585 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:07:13,585 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-01-19 06:07:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:07:13,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211809195] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:07:13,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:07:13,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-01-19 06:07:13,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853468822] [2022-01-19 06:07:13,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:07:13,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 06:07:13,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:07:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 06:07:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=4, NotChecked=50, Total=756 [2022-01-19 06:07:13,603 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 200 [2022-01-19 06:07:13,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 139 transitions, 600 flow. Second operand has 28 states, 28 states have (on average 115.46428571428571) internal successors, (3233), 28 states have internal predecessors, (3233), 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-01-19 06:07:13,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:07:13,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 200 [2022-01-19 06:07:13,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:07:14,540 INFO L129 PetriNetUnfolder]: 135/1027 cut-off events. [2022-01-19 06:07:14,540 INFO L130 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-01-19 06:07:14,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 1027 events. 135/1027 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5931 event pairs, 0 based on Foata normal form. 3/1009 useless extension candidates. Maximal degree in co-relation 1992. Up to 116 conditions per place. [2022-01-19 06:07:14,556 INFO L132 encePairwiseOnDemand]: 183/200 looper letters, 128 selfloop transitions, 62 changer transitions 0/276 dead transitions. [2022-01-19 06:07:14,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 276 transitions, 1425 flow [2022-01-19 06:07:14,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:07:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:07:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3566 transitions. [2022-01-19 06:07:14,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5943333333333334 [2022-01-19 06:07:14,564 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3566 transitions. [2022-01-19 06:07:14,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3566 transitions. [2022-01-19 06:07:14,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:07:14,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3566 transitions. [2022-01-19 06:07:14,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 118.86666666666666) internal successors, (3566), 30 states have internal predecessors, (3566), 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-01-19 06:07:14,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 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-01-19 06:07:14,579 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 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-01-19 06:07:14,579 INFO L186 Difference]: Start difference. First operand has 180 places, 139 transitions, 600 flow. Second operand 30 states and 3566 transitions. [2022-01-19 06:07:14,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 276 transitions, 1425 flow [2022-01-19 06:07:14,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 276 transitions, 1381 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:07:14,585 INFO L242 Difference]: Finished difference. Result has 208 places, 200 transitions, 1106 flow [2022-01-19 06:07:14,585 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1106, PETRI_PLACES=208, PETRI_TRANSITIONS=200} [2022-01-19 06:07:14,585 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 42 predicate places. [2022-01-19 06:07:14,586 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 200 transitions, 1106 flow [2022-01-19 06:07:14,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 115.46428571428571) internal successors, (3233), 28 states have internal predecessors, (3233), 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-01-19 06:07:14,586 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:07:14,587 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:07:14,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 06:07:14,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:14,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:07:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:07:14,803 INFO L85 PathProgramCache]: Analyzing trace with hash -475919971, now seen corresponding path program 1 times [2022-01-19 06:07:14,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:07:14,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539065857] [2022-01-19 06:07:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:14,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:07:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:07:15,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:07:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539065857] [2022-01-19 06:07:15,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539065857] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:07:15,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838760095] [2022-01-19 06:07:15,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:07:15,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:07:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:07:15,589 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-01-19 06:07:15,592 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-01-19 06:07:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:07:15,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:07:15,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:07:15,755 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-01-19 06:07:16,143 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:07:16,143 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-01-19 06:07:16,197 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-01-19 06:07:16,392 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 24 treesize of output 17 [2022-01-19 06:07:16,515 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 32 treesize of output 25 [2022-01-19 06:07:16,641 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 14 treesize of output 10 [2022-01-19 06:07:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:07:16,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:07:20,827 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:07:22,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:07:24,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:07:26,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:07:28,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:07:30,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:07:30,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_322) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:07:31,343 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 9 treesize of output 7 [2022-01-19 06:07:31,371 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:07:31,371 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-01-19 06:07:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:07:31,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838760095] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:07:31,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:07:31,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-01-19 06:07:31,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072250914] [2022-01-19 06:07:31,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:07:31,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 06:07:31,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:07:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 06:07:31,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1401, Unknown=8, NotChecked=486, Total=2070 [2022-01-19 06:07:31,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 200 [2022-01-19 06:07:31,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 200 transitions, 1106 flow. Second operand has 46 states, 46 states have (on average 110.76086956521739) internal successors, (5095), 46 states have internal predecessors, (5095), 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-01-19 06:07:31,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:07:31,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 200 [2022-01-19 06:07:31,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:07:44,981 WARN L228 SmtUtils]: Spent 12.83s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:07:50,486 WARN L228 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:07:51,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:08:04,774 WARN L228 SmtUtils]: Spent 13.63s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:08:05,658 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:08:06,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:08:18,404 WARN L228 SmtUtils]: Spent 11.32s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:08:19,079 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:08:30,800 WARN L228 SmtUtils]: Spent 11.62s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:08:36,647 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:08:37,006 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:08:49,791 WARN L228 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:08:56,195 WARN L228 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:08:56,511 INFO L129 PetriNetUnfolder]: 1182/4829 cut-off events. [2022-01-19 06:08:56,511 INFO L130 PetriNetUnfolder]: For 4282/4293 co-relation queries the response was YES. [2022-01-19 06:08:56,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 4829 events. 1182/4829 cut-off events. For 4282/4293 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 37817 event pairs, 6 based on Foata normal form. 15/4753 useless extension candidates. Maximal degree in co-relation 10746. Up to 789 conditions per place. [2022-01-19 06:08:56,590 INFO L132 encePairwiseOnDemand]: 169/200 looper letters, 392 selfloop transitions, 281 changer transitions 59/809 dead transitions. [2022-01-19 06:08:56,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 809 transitions, 5096 flow [2022-01-19 06:08:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-01-19 06:08:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2022-01-19 06:08:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 12508 transitions. [2022-01-19 06:08:56,609 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5685454545454546 [2022-01-19 06:08:56,609 INFO L72 ComplementDD]: Start complementDD. Operand 110 states and 12508 transitions. [2022-01-19 06:08:56,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 12508 transitions. [2022-01-19 06:08:56,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:56,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 110 states and 12508 transitions. [2022-01-19 06:08:56,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 111 states, 110 states have (on average 113.7090909090909) internal successors, (12508), 110 states have internal predecessors, (12508), 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-01-19 06:08:56,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 111 states, 111 states have (on average 200.0) internal successors, (22200), 111 states have internal predecessors, (22200), 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-01-19 06:08:56,664 INFO L81 ComplementDD]: Finished complementDD. Result has 111 states, 111 states have (on average 200.0) internal successors, (22200), 111 states have internal predecessors, (22200), 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-01-19 06:08:56,664 INFO L186 Difference]: Start difference. First operand has 208 places, 200 transitions, 1106 flow. Second operand 110 states and 12508 transitions. [2022-01-19 06:08:56,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 809 transitions, 5096 flow [2022-01-19 06:08:56,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 809 transitions, 4861 flow, removed 114 selfloop flow, removed 4 redundant places. [2022-01-19 06:08:56,715 INFO L242 Difference]: Finished difference. Result has 389 places, 438 transitions, 3237 flow [2022-01-19 06:08:56,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=110, PETRI_FLOW=3237, PETRI_PLACES=389, PETRI_TRANSITIONS=438} [2022-01-19 06:08:56,717 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 223 predicate places. [2022-01-19 06:08:56,717 INFO L470 AbstractCegarLoop]: Abstraction has has 389 places, 438 transitions, 3237 flow [2022-01-19 06:08:56,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 110.76086956521739) internal successors, (5095), 46 states have internal predecessors, (5095), 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-01-19 06:08:56,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:56,720 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:56,748 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-01-19 06:08:56,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:56,936 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:08:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1525635077, now seen corresponding path program 1 times [2022-01-19 06:08:56,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:56,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916643156] [2022-01-19 06:08:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:56,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:08:57,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916643156] [2022-01-19 06:08:57,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916643156] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840247982] [2022-01-19 06:08:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:57,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:57,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:08:57,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:08:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:57,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:08:57,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:57,927 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-01-19 06:08:58,261 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:08:58,261 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-01-19 06:08:58,313 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-01-19 06:08:58,525 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 24 treesize of output 17 [2022-01-19 06:08:58,739 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 32 treesize of output 25 [2022-01-19 06:08:58,880 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 14 treesize of output 10 [2022-01-19 06:08:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:08:58,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:09:03,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:03,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-19 06:09:03,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-19 06:09:05,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-19 06:09:07,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-19 06:09:09,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) is different from false [2022-01-19 06:09:10,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_418) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:09:10,411 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 9 treesize of output 7 [2022-01-19 06:09:10,439 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:09:10,440 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-01-19 06:09:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:09:10,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840247982] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:09:10,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:09:10,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:09:10,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158878936] [2022-01-19 06:09:10,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:09:10,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:09:10,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:09:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1477, Unknown=8, NotChecked=498, Total=2162 [2022-01-19 06:09:10,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 200 [2022-01-19 06:09:10,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 438 transitions, 3237 flow. Second operand has 47 states, 47 states have (on average 110.76595744680851) internal successors, (5206), 47 states have internal predecessors, (5206), 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-01-19 06:09:10,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:10,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 200 [2022-01-19 06:09:10,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:23,018 WARN L228 SmtUtils]: Spent 11.89s on a formula simplification. DAG size of input: 60 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:29,552 WARN L228 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 40 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:30,101 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= .cse1 (store .cse2 .cse3 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (<= .cse3 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-19 06:09:41,373 WARN L228 SmtUtils]: Spent 11.23s on a formula simplification. DAG size of input: 51 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:41,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:09:59,445 WARN L228 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 56 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:00,095 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:10:00,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:10:01,315 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:10:01,842 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:10:02,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|) 0)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:10:13,578 WARN L228 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:22,960 WARN L228 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:32,100 WARN L228 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:39,909 WARN L228 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:48,423 WARN L228 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:49,819 INFO L129 PetriNetUnfolder]: 2258/9037 cut-off events. [2022-01-19 06:10:49,819 INFO L130 PetriNetUnfolder]: For 299479/299569 co-relation queries the response was YES. [2022-01-19 06:10:49,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52033 conditions, 9037 events. 2258/9037 cut-off events. For 299479/299569 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 82788 event pairs, 186 based on Foata normal form. 72/8933 useless extension candidates. Maximal degree in co-relation 51915. Up to 1718 conditions per place. [2022-01-19 06:10:49,945 INFO L132 encePairwiseOnDemand]: 169/200 looper letters, 582 selfloop transitions, 571 changer transitions 40/1270 dead transitions. [2022-01-19 06:10:49,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1270 transitions, 16381 flow [2022-01-19 06:10:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-01-19 06:10:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2022-01-19 06:10:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 13401 transitions. [2022-01-19 06:10:49,954 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5678389830508475 [2022-01-19 06:10:49,954 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 13401 transitions. [2022-01-19 06:10:49,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 13401 transitions. [2022-01-19 06:10:49,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:10:49,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 13401 transitions. [2022-01-19 06:10:49,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 113.5677966101695) internal successors, (13401), 118 states have internal predecessors, (13401), 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-01-19 06:10:49,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 200.0) internal successors, (23800), 119 states have internal predecessors, (23800), 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-01-19 06:10:49,986 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 200.0) internal successors, (23800), 119 states have internal predecessors, (23800), 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-01-19 06:10:49,986 INFO L186 Difference]: Start difference. First operand has 389 places, 438 transitions, 3237 flow. Second operand 118 states and 13401 transitions. [2022-01-19 06:10:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1270 transitions, 16381 flow [2022-01-19 06:10:50,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1270 transitions, 15173 flow, removed 549 selfloop flow, removed 25 redundant places. [2022-01-19 06:10:50,493 INFO L242 Difference]: Finished difference. Result has 520 places, 874 transitions, 9092 flow [2022-01-19 06:10:50,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=2812, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=9092, PETRI_PLACES=520, PETRI_TRANSITIONS=874} [2022-01-19 06:10:50,495 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 354 predicate places. [2022-01-19 06:10:50,495 INFO L470 AbstractCegarLoop]: Abstraction has has 520 places, 874 transitions, 9092 flow [2022-01-19 06:10:50,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 110.76595744680851) internal successors, (5206), 47 states have internal predecessors, (5206), 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-01-19 06:10:50,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:10:50,497 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:10:50,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:10:50,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 06:10:50,715 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:10:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:10:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1351034911, now seen corresponding path program 2 times [2022-01-19 06:10:50,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:10:50,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776063762] [2022-01-19 06:10:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:50,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:10:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:10:51,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:10:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776063762] [2022-01-19 06:10:51,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776063762] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:10:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982695104] [2022-01-19 06:10:51,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:10:51,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:10:51,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:10:51,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:10:51,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:10:51,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:10:51,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:10:51,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:10:51,700 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-01-19 06:10:52,015 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:10:52,016 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-01-19 06:10:52,061 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-01-19 06:10:52,239 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-01-19 06:10:52,673 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-01-19 06:11:07,896 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-01-19 06:11:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:07,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:17,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (= (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_518)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) |c_~#cache~0.offset|)) 0))) is different from false [2022-01-19 06:11:20,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (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_45| v_ArrVal_518)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-01-19 06:11:20,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int) (|~#cache~0.offset| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) 1) v_ArrVal_518) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113|))) is different from false [2022-01-19 06:11:21,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_518 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int) (|~#cache~0.offset| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_514) |c_~#cache~0.base|) (+ |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) 1) v_ArrVal_518) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113|))) is different from false [2022-01-19 06:11:25,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:11:25,844 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 17 treesize of output 7 [2022-01-19 06:11:25,894 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:11:25,894 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-01-19 06:11:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 9 not checked. [2022-01-19 06:11:25,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982695104] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:25,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:25,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 45 [2022-01-19 06:11:25,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197959947] [2022-01-19 06:11:25,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:25,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-19 06:11:25,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-19 06:11:25,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1435, Unknown=18, NotChecked=324, Total=1980 [2022-01-19 06:11:25,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 200 [2022-01-19 06:11:25,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 874 transitions, 9092 flow. Second operand has 45 states, 45 states have (on average 116.4888888888889) internal successors, (5242), 45 states have internal predecessors, (5242), 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-01-19 06:11:25,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:25,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 200 [2022-01-19 06:11:25,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:35,363 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int) (|~#cache~0.offset| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) 1) v_ArrVal_518) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113|))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:11:37,003 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int) (|~#cache~0.offset| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) 1) v_ArrVal_518) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28))) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45_113|))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:11:42,678 WARN L228 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 67 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:49,482 WARN L228 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 76 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:50,726 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) .cse3 (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= |c_ULTIMATE.start_main_~i~3#1| 0))) (and .cse3 (= .cse0 .cse1)))) .cse3 (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (= (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_518)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) |c_~#cache~0.offset|)) 0))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_~#cache~0.base| 4) (exists ((v_ArrVal_515 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_515))))) is different from false [2022-01-19 06:11:51,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (= (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_518)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) |c_~#cache~0.offset|)) 0))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (or (and .cse0 (= .cse1 .cse2)) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) .cse0 (<= .cse3 0))))) (= |c_~#cache~0.base| 4) (exists ((v_ArrVal_515 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_515))))) is different from false [2022-01-19 06:11:52,641 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| Int) (v_ArrVal_518 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) (= (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_518)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43_117| 28) |c_~#cache~0.offset|)) 0))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 4) (exists ((v_ArrVal_515 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_515)))) is different from false [2022-01-19 06:12:34,820 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse5 .cse0))) (let ((.cse1 (store .cse5 .cse10 0)) (.cse8 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse8 |c_~#cache~0.offset|)) (.cse9 (@diff .cse1 .cse0))) (let ((.cse2 (+ .cse9 28)) (.cse6 (<= (+ 28 .cse10) .cse3)) (.cse4 (store .cse1 .cse9 0))) (or (and (or (= .cse0 .cse1) (<= .cse2 .cse3)) (= .cse0 .cse4) (or (= .cse0 .cse5) .cse6)) (let ((.cse7 (@diff .cse4 .cse0))) (and (<= (+ .cse7 28) .cse3) (<= .cse2 .cse8) (= .cse0 (store .cse4 .cse7 0)) .cse6)))))))) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|))))) is different from false [2022-01-19 06:12:59,886 WARN L228 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 75 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:05,550 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse10 (@diff .cse5 .cse0))) (let ((.cse1 (store .cse5 .cse10 0)) (.cse8 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse8 |c_~#cache~0.offset|)) (.cse9 (@diff .cse1 .cse0))) (let ((.cse2 (+ .cse9 28)) (.cse6 (<= (+ 28 .cse10) .cse3)) (.cse4 (store .cse1 .cse9 0))) (or (and (or (= .cse0 .cse1) (<= .cse2 .cse3)) (= .cse0 .cse4) (or (= .cse0 .cse5) .cse6)) (let ((.cse7 (@diff .cse4 .cse0))) (and (<= (+ .cse7 28) .cse3) (<= .cse2 .cse8) (= .cse0 (store .cse4 .cse7 0)) .cse6)))))))) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|)))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_518 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_518)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| Int) (|aux_mod_~#cache~0.offset_105| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_div_~#cache~0.offset_105| Int) (v_ArrVal_518 Int)) (and (< |aux_mod_~#cache~0.offset_105| 28) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |aux_div_~#cache~0.offset_105|) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store ((as const (Array Int Int)) 0) (+ (* (- 28) |aux_div_~#cache~0.offset_105|) (* (- 1) |aux_mod_~#cache~0.offset_105|) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_518) (select |c_#memory_int| 4)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= 0 |aux_mod_~#cache~0.offset_105|))) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:13:26,852 WARN L228 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 56 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:37,366 INFO L129 PetriNetUnfolder]: 3359/13597 cut-off events. [2022-01-19 06:13:37,366 INFO L130 PetriNetUnfolder]: For 859290/859555 co-relation queries the response was YES. [2022-01-19 06:13:37,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97954 conditions, 13597 events. 3359/13597 cut-off events. For 859290/859555 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 132487 event pairs, 403 based on Foata normal form. 116/13396 useless extension candidates. Maximal degree in co-relation 97801. Up to 3854 conditions per place. [2022-01-19 06:13:37,741 INFO L132 encePairwiseOnDemand]: 171/200 looper letters, 1058 selfloop transitions, 595 changer transitions 33/1860 dead transitions. [2022-01-19 06:13:37,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 1860 transitions, 28122 flow [2022-01-19 06:13:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-01-19 06:13:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2022-01-19 06:13:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 9680 transitions. [2022-01-19 06:13:37,751 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5975308641975309 [2022-01-19 06:13:37,751 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 9680 transitions. [2022-01-19 06:13:37,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 9680 transitions. [2022-01-19 06:13:37,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:37,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 9680 transitions. [2022-01-19 06:13:37,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 82 states, 81 states have (on average 119.50617283950618) internal successors, (9680), 81 states have internal predecessors, (9680), 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-01-19 06:13:37,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 82 states, 82 states have (on average 200.0) internal successors, (16400), 82 states have internal predecessors, (16400), 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-01-19 06:13:37,771 INFO L81 ComplementDD]: Finished complementDD. Result has 82 states, 82 states have (on average 200.0) internal successors, (16400), 82 states have internal predecessors, (16400), 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-01-19 06:13:37,771 INFO L186 Difference]: Start difference. First operand has 520 places, 874 transitions, 9092 flow. Second operand 81 states and 9680 transitions. [2022-01-19 06:13:37,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 1860 transitions, 28122 flow [2022-01-19 06:13:39,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 1860 transitions, 25543 flow, removed 1037 selfloop flow, removed 36 redundant places. [2022-01-19 06:13:39,287 INFO L242 Difference]: Finished difference. Result has 615 places, 1436 transitions, 16575 flow [2022-01-19 06:13:39,287 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=7708, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=16575, PETRI_PLACES=615, PETRI_TRANSITIONS=1436} [2022-01-19 06:13:39,288 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 449 predicate places. [2022-01-19 06:13:39,288 INFO L470 AbstractCegarLoop]: Abstraction has has 615 places, 1436 transitions, 16575 flow [2022-01-19 06:13:39,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 116.4888888888889) internal successors, (5242), 45 states have internal predecessors, (5242), 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-01-19 06:13:39,289 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:39,289 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:13:39,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-19 06:13:39,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:39,506 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:13:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1160141613, now seen corresponding path program 1 times [2022-01-19 06:13:39,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:39,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525354218] [2022-01-19 06:13:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:39,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:13:40,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:13:40,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525354218] [2022-01-19 06:13:40,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525354218] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:13:40,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82609584] [2022-01-19 06:13:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:40,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:13:40,467 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:13:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:13:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:40,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:13:40,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:13:40,620 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-01-19 06:13:40,956 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:13:40,957 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-01-19 06:13:41,002 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-01-19 06:13:41,217 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 24 treesize of output 17 [2022-01-19 06:13:41,356 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 32 treesize of output 25 [2022-01-19 06:13:41,495 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 14 treesize of output 10 [2022-01-19 06:13:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:13:41,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:13:45,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:13:47,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:13:48,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:13:50,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:13:52,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:13:52,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:13:52,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_610 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_610) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:13:52,961 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 9 treesize of output 7 [2022-01-19 06:13:53,007 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:13:53,007 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-01-19 06:13:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:13:53,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82609584] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:13:53,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:13:53,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:13:53,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493856740] [2022-01-19 06:13:53,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:13:53,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:13:53,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:13:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:13:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1478, Unknown=8, NotChecked=498, Total=2162 [2022-01-19 06:13:53,022 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 200 [2022-01-19 06:13:53,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 1436 transitions, 16575 flow. Second operand has 47 states, 47 states have (on average 110.82978723404256) internal successors, (5209), 47 states have internal predecessors, (5209), 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-01-19 06:13:53,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:13:53,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 200 [2022-01-19 06:13:53,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:14:07,218 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:21,261 WARN L228 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:39,300 WARN L228 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:51,344 WARN L228 SmtUtils]: Spent 11.63s on a formula simplification. DAG size of input: 57 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:57,275 WARN L228 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:57,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:14:58,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:14:59,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:15:09,611 WARN L228 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:10,173 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:15:16,803 WARN L228 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:17,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:15:17,997 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:15:35,950 WARN L228 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:37,537 INFO L129 PetriNetUnfolder]: 4822/17290 cut-off events. [2022-01-19 06:15:37,537 INFO L130 PetriNetUnfolder]: For 1417901/1418119 co-relation queries the response was YES. [2022-01-19 06:15:37,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144490 conditions, 17290 events. 4822/17290 cut-off events. For 1417901/1418119 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 168468 event pairs, 367 based on Foata normal form. 67/17049 useless extension candidates. Maximal degree in co-relation 144288. Up to 6283 conditions per place. [2022-01-19 06:15:38,044 INFO L132 encePairwiseOnDemand]: 171/200 looper letters, 1532 selfloop transitions, 907 changer transitions 0/2516 dead transitions. [2022-01-19 06:15:38,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 2516 transitions, 40290 flow [2022-01-19 06:15:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-19 06:15:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-01-19 06:15:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 8523 transitions. [2022-01-19 06:15:38,066 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5682 [2022-01-19 06:15:38,067 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 8523 transitions. [2022-01-19 06:15:38,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 8523 transitions. [2022-01-19 06:15:38,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:15:38,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 8523 transitions. [2022-01-19 06:15:38,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 113.64) internal successors, (8523), 75 states have internal predecessors, (8523), 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-01-19 06:15:38,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 200.0) internal successors, (15200), 76 states have internal predecessors, (15200), 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-01-19 06:15:38,106 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 200.0) internal successors, (15200), 76 states have internal predecessors, (15200), 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-01-19 06:15:38,106 INFO L186 Difference]: Start difference. First operand has 615 places, 1436 transitions, 16575 flow. Second operand 75 states and 8523 transitions. [2022-01-19 06:15:38,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 2516 transitions, 40290 flow [2022-01-19 06:15:40,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 2516 transitions, 38305 flow, removed 983 selfloop flow, removed 6 redundant places. [2022-01-19 06:15:40,703 INFO L242 Difference]: Finished difference. Result has 748 places, 2179 transitions, 31854 flow [2022-01-19 06:15:40,705 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=15481, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=31854, PETRI_PLACES=748, PETRI_TRANSITIONS=2179} [2022-01-19 06:15:40,705 INFO L334 CegarLoopForPetriNet]: 166 programPoint places, 582 predicate places. [2022-01-19 06:15:40,705 INFO L470 AbstractCegarLoop]: Abstraction has has 748 places, 2179 transitions, 31854 flow [2022-01-19 06:15:40,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 110.82978723404256) internal successors, (5209), 47 states have internal predecessors, (5209), 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-01-19 06:15:40,706 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:15:40,706 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:15:40,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-19 06:15:40,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 06:15:40,911 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:15:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:15:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash -475136639, now seen corresponding path program 2 times [2022-01-19 06:15:40,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:15:40,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226549285] [2022-01-19 06:15:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:15:40,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:15:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:15:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:15:41,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:15:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226549285] [2022-01-19 06:15:41,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226549285] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:15:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476000978] [2022-01-19 06:15:41,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:15:41,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:15:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:15:41,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:15:41,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:15:41,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:15:41,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:15:41,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:15:41,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:15:41,823 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-01-19 06:15:42,045 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:15:42,045 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-01-19 06:15:42,085 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-01-19 06:15:42,253 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-01-19 06:15:42,692 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-01-19 06:15:59,241 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-01-19 06:15:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:15:59,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:16:05,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_43|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))))) is different from false [2022-01-19 06:16:07,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-01-19 06:16:09,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 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_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-01-19 06:16:12,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (= (select (select (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_56| v_ArrVal_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-01-19 06:16:12,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_709) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-01-19 06:16:12,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_706 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_706) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_709) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-01-19 06:16:15,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:16:15,502 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 9 treesize of output 7 [2022-01-19 06:16:15,536 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:16:15,539 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-01-19 06:16:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 9 not checked. [2022-01-19 06:16:15,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476000978] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:16:15,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:16:15,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 45 [2022-01-19 06:16:15,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149276718] [2022-01-19 06:16:15,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:16:15,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-19 06:16:15,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:16:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-19 06:16:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1312, Unknown=20, NotChecked=474, Total=1980 [2022-01-19 06:16:15,556 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 200 [2022-01-19 06:16:15,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 2179 transitions, 31854 flow. Second operand has 45 states, 45 states have (on average 116.55555555555556) internal successors, (5245), 45 states have internal predecessors, (5245), 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-01-19 06:16:15,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:16:15,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 200 [2022-01-19 06:16:15,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:16:21,116 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_709) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (= (select |c_#valid| 4) 1) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:16:22,505 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_709) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:16:31,148 WARN L228 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 73 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:32,186 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) .cse3 (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= |c_ULTIMATE.start_main_~i~3#1| 0))) (and .cse3 (= .cse0 .cse1)))) (exists ((v_ArrVal_708 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_708) (select |c_#memory_int| |c_~#cache~0.base|))) .cse3 (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 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_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:16:32,698 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_708 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_708) (select |c_#memory_int| |c_~#cache~0.base|))) .cse0 (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 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_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (or (and .cse0 (= .cse1 .cse2)) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) .cse0 (<= .cse3 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:16:35,264 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_708 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_708) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 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_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:17:36,494 WARN L228 SmtUtils]: Spent 18.00s on a formula simplification. DAG size of input: 70 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:18:25,724 WARN L228 SmtUtils]: Spent 25.04s on a formula simplification. DAG size of input: 54 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:07,944 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_708 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_708) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_709 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 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_709)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:21:04,520 INFO L129 PetriNetUnfolder]: 7283/27944 cut-off events. [2022-01-19 06:21:04,520 INFO L130 PetriNetUnfolder]: For 2013128/2014009 co-relation queries the response was YES. [2022-01-19 06:21:05,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226969 conditions, 27944 events. 7283/27944 cut-off events. For 2013128/2014009 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 311559 event pairs, 200 based on Foata normal form. 542/27953 useless extension candidates. Maximal degree in co-relation 226703. Up to 6690 conditions per place. [2022-01-19 06:21:05,360 INFO L132 encePairwiseOnDemand]: 169/200 looper letters, 2552 selfloop transitions, 2049 changer transitions 0/4843 dead transitions. [2022-01-19 06:21:05,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 840 places, 4843 transitions, 90310 flow [2022-01-19 06:21:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-01-19 06:21:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-01-19 06:21:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 11145 transitions. [2022-01-19 06:21:05,369 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5991935483870968 [2022-01-19 06:21:05,369 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 11145 transitions. [2022-01-19 06:21:05,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 11145 transitions. [2022-01-19 06:21:05,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:05,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 11145 transitions. [2022-01-19 06:21:05,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 119.83870967741936) internal successors, (11145), 93 states have internal predecessors, (11145), 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-01-19 06:21:05,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 200.0) internal successors, (18800), 94 states have internal predecessors, (18800), 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-01-19 06:21:05,393 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 200.0) internal successors, (18800), 94 states have internal predecessors, (18800), 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-01-19 06:21:05,394 INFO L186 Difference]: Start difference. First operand has 748 places, 2179 transitions, 31854 flow. Second operand 93 states and 11145 transitions. [2022-01-19 06:21:05,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 840 places, 4843 transitions, 90310 flow Received shutdown request... [2022-01-19 06:21:09,385 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:21:09,385 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-01-19 06:21:09,389 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:21:09,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-19 06:21:09,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 06:21:09,606 WARN L594 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-01-19 06:21:09,607 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:21:09,607 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:21:09,609 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-01-19 06:21:09,610 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 06:21:09,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:21:09,612 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:09,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:21:09,612 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 06:21:09,613 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:21:09,613 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 06:21:09,613 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 06:21:09,613 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 06:21:09,613 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:21:09,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:21:09 BasicIcfg [2022-01-19 06:21:09,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:21:09,615 INFO L158 Benchmark]: Toolchain (without parser) took 853126.42ms. Allocated memory was 377.5MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 322.3MB in the beginning and 4.2GB in the end (delta: -3.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2022-01-19 06:21:09,615 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 377.5MB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:21:09,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.96ms. Allocated memory is still 377.5MB. Free memory was 322.0MB in the beginning and 330.0MB in the end (delta: -8.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. [2022-01-19 06:21:09,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.80ms. Allocated memory is still 377.5MB. Free memory was 330.0MB in the beginning and 328.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:21:09,616 INFO L158 Benchmark]: Boogie Preprocessor took 18.53ms. Allocated memory is still 377.5MB. Free memory was 328.0MB in the beginning and 326.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:21:09,616 INFO L158 Benchmark]: RCFGBuilder took 460.31ms. Allocated memory is still 377.5MB. Free memory was 326.0MB in the beginning and 308.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 06:21:09,616 INFO L158 Benchmark]: TraceAbstraction took 851922.21ms. Allocated memory was 377.5MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 308.1MB in the beginning and 4.2GB in the end (delta: -3.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2022-01-19 06:21:09,617 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.09ms. Allocated memory is still 377.5MB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 665.96ms. Allocated memory is still 377.5MB. Free memory was 322.0MB in the beginning and 330.0MB in the end (delta: -8.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.80ms. Allocated memory is still 377.5MB. Free memory was 330.0MB in the beginning and 328.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.53ms. Allocated memory is still 377.5MB. Free memory was 328.0MB in the beginning and 326.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 460.31ms. Allocated memory is still 377.5MB. Free memory was 326.0MB in the beginning and 308.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 851922.21ms. Allocated memory was 377.5MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 308.1MB in the beginning and 4.2GB in the end (delta: -3.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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 executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 851.7s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 722.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7074 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7074 mSDsluCounter, 8622 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8246 IncrementalHoareTripleChecker+Unchecked, 8260 mSDsCounter, 620 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5025 IncrementalHoareTripleChecker+Invalid, 13891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 620 mSolverCounterUnsat, 384 mSDtfsCounter, 5025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3012 GetRequests, 2157 SyntacticMatches, 54 SemanticMatches, 801 ConstructedPredicates, 61 IntricatePredicates, 26 DeprecatedPredicates, 26309 ImplicationChecksByTransitivity, 771.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31854occurred in iteration=12, InterpolantAutomatonStates: 501, 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.4s SatisfiabilityAnalysisTime, 124.6s InterpolantComputationTime, 2454 NumberOfCodeBlocks, 2439 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3478 ConstructedInterpolants, 733 QuantifiedInterpolants, 54509 SizeOfPredicates, 140 NumberOfNonLiveVariables, 2710 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 4299/4823 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 thread instance sufficiency with 1 thread instances CFG has 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: 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