./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:09:01,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:09:01,112 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:09:01,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:09:01,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:09:01,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:09:01,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:09:01,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:09:01,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:09:01,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:09:01,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:09:01,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:09:01,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:09:01,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:09:01,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:09:01,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:09:01,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:09:01,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:09:01,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:09:01,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:09:01,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:09:01,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:09:01,160 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:09:01,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:09:01,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:09:01,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:09:01,162 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:09:01,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:09:01,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:09:01,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:09:01,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:01,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:09:01,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:09:01,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:09:01,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:09:01,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:09:01,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:09:01,168 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:09:01,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:09:01,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:09:01,169 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:09:01,169 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2023-11-06 22:09:01,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:09:01,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:09:01,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:09:01,507 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:09:01,507 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:09:01,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2023-11-06 22:09:04,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:09:04,922 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:09:04,922 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2023-11-06 22:09:04,941 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/data/6fc01a94c/d9a72b6aac73414a82e9cddbf91472b0/FLAG67bcc094c [2023-11-06 22:09:04,957 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/data/6fc01a94c/d9a72b6aac73414a82e9cddbf91472b0 [2023-11-06 22:09:04,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:09:04,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:09:04,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:04,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:09:04,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:09:04,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:04" (1/1) ... [2023-11-06 22:09:04,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471dda01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:04, skipping insertion in model container [2023-11-06 22:09:04,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:04" (1/1) ... [2023-11-06 22:09:05,065 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:09:05,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:09:05,648 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:09:05,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:09:05,784 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:09:05,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05 WrapperNode [2023-11-06 22:09:05,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:05,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:09:05,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:09:05,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:09:05,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,870 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-11-06 22:09:05,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:09:05,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:09:05,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:09:05,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:09:05,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:09:05,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:09:05,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:09:05,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:09:05,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (1/1) ... [2023-11-06 22:09:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:05,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:09:06,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:09:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:09:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:09:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:09:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:09:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:09:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:09:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-06 22:09:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-06 22:09:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:09:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:09:06,061 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:09:06,244 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:09:06,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:09:06,567 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:09:06,575 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:09:06,577 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:09:06,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:09:06 BoogieIcfgContainer [2023-11-06 22:09:06,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:09:06,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:09:06,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:09:06,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:09:06,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:09:04" (1/3) ... [2023-11-06 22:09:06,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2152f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:09:06, skipping insertion in model container [2023-11-06 22:09:06,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:05" (2/3) ... [2023-11-06 22:09:06,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2152f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:09:06, skipping insertion in model container [2023-11-06 22:09:06,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:09:06" (3/3) ... [2023-11-06 22:09:06,598 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-11-06 22:09:06,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:09:06,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:09:06,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-06 22:09:06,622 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:09:06,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:09:06,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 95 transitions, 194 flow [2023-11-06 22:09:06,803 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-06 22:09:06,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:09:06,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 6/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-06 22:09:06,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 95 transitions, 194 flow [2023-11-06 22:09:06,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 94 transitions, 191 flow [2023-11-06 22:09:06,821 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:09:06,843 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 94 transitions, 191 flow [2023-11-06 22:09:06,851 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 94 transitions, 191 flow [2023-11-06 22:09:06,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 94 transitions, 191 flow [2023-11-06 22:09:06,907 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-06 22:09:06,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:09:06,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 6/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-06 22:09:06,915 INFO L119 LiptonReduction]: Number of co-enabled transitions 2304 [2023-11-06 22:09:09,396 INFO L134 LiptonReduction]: Checked pairs total: 3124 [2023-11-06 22:09:09,396 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-06 22:09:09,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:09:09,430 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c09c22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:09:09,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-06 22:09:09,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:09:09,433 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-11-06 22:09:09,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:09:09,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:09,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:09:09,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:09,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash 11877, now seen corresponding path program 1 times [2023-11-06 22:09:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815446600] [2023-11-06 22:09:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815446600] [2023-11-06 22:09:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815446600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:09,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:09:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192235708] [2023-11-06 22:09:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:09:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:09:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:09:09,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 187 [2023-11-06 22:09:09,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2023-11-06 22:09:09,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:09,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 187 [2023-11-06 22:09:09,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:09,988 INFO L124 PetriNetUnfolderBase]: 102/206 cut-off events. [2023-11-06 22:09:09,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:09:09,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 206 events. 102/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 728 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 400. Up to 206 conditions per place. [2023-11-06 22:09:09,994 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-11-06 22:09:09,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 107 flow [2023-11-06 22:09:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:09:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:09:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-11-06 22:09:10,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080213903743316 [2023-11-06 22:09:10,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-11-06 22:09:10,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-11-06 22:09:10,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:10,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-11-06 22:09:10,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-11-06 22:09:10,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:10,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:10,046 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 285 transitions. [2023-11-06 22:09:10,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 107 flow [2023-11-06 22:09:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:10,050 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 66 flow [2023-11-06 22:09:10,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-11-06 22:09:10,059 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-11-06 22:09:10,059 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 66 flow [2023-11-06 22:09:10,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2023-11-06 22:09:10,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:10,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:09:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:09:10,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:10,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 369183, now seen corresponding path program 1 times [2023-11-06 22:09:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725624345] [2023-11-06 22:09:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:10,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725624345] [2023-11-06 22:09:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725624345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:09:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322352228] [2023-11-06 22:09:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:10,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:09:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:09:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:09:10,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 187 [2023-11-06 22:09:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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) [2023-11-06 22:09:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 187 [2023-11-06 22:09:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:10,305 INFO L124 PetriNetUnfolderBase]: 102/205 cut-off events. [2023-11-06 22:09:10,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:09:10,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 205 events. 102/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 725 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 410. Up to 203 conditions per place. [2023-11-06 22:09:10,313 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-11-06 22:09:10,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 112 flow [2023-11-06 22:09:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:09:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:09:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-11-06 22:09:10,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49910873440285203 [2023-11-06 22:09:10,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-11-06 22:09:10,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-11-06 22:09:10,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:10,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-11-06 22:09:10,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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) [2023-11-06 22:09:10,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:10,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:10,325 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 66 flow. Second operand 3 states and 280 transitions. [2023-11-06 22:09:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 112 flow [2023-11-06 22:09:10,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:10,328 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 62 flow [2023-11-06 22:09:10,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2023-11-06 22:09:10,332 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-11-06 22:09:10,332 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 62 flow [2023-11-06 22:09:10,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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) [2023-11-06 22:09:10,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:10,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:09:10,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:10,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1678589801, now seen corresponding path program 1 times [2023-11-06 22:09:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:10,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49566729] [2023-11-06 22:09:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49566729] [2023-11-06 22:09:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49566729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969982591] [2023-11-06 22:09:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:10,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:10,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:10,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:09:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:10,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:09:10,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:10,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969982591] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:10,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-06 22:09:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771391483] [2023-11-06 22:09:10,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:10,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:10,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:10,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 187 [2023-11-06 22:09:10,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 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) [2023-11-06 22:09:10,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:10,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 187 [2023-11-06 22:09:10,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:10,799 INFO L124 PetriNetUnfolderBase]: 102/208 cut-off events. [2023-11-06 22:09:10,799 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:09:10,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 208 events. 102/208 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 726 event pairs, 81 based on Foata normal form. 3/111 useless extension candidates. Maximal degree in co-relation 404. Up to 205 conditions per place. [2023-11-06 22:09:10,802 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-11-06 22:09:10,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 130 flow [2023-11-06 22:09:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:09:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:09:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2023-11-06 22:09:10,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768270944741533 [2023-11-06 22:09:10,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 535 transitions. [2023-11-06 22:09:10,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions. [2023-11-06 22:09:10,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:10,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions. [2023-11-06 22:09:10,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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) [2023-11-06 22:09:10,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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) [2023-11-06 22:09:10,812 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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) [2023-11-06 22:09:10,813 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 6 states and 535 transitions. [2023-11-06 22:09:10,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 130 flow [2023-11-06 22:09:10,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:09:10,815 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 94 flow [2023-11-06 22:09:10,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-11-06 22:09:10,817 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-11-06 22:09:10,817 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 94 flow [2023-11-06 22:09:10,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 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) [2023-11-06 22:09:10,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:10,818 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:10,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:11,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:11,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1624959185, now seen corresponding path program 2 times [2023-11-06 22:09:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:11,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234320510] [2023-11-06 22:09:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234320510] [2023-11-06 22:09:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234320510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037848274] [2023-11-06 22:09:11,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:09:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:11,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:11,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:09:11,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:09:11,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:11,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:09:11,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:11,343 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:09:11,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:11,449 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-06 22:09:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:09:11,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:09:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037848274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:09:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-11-06 22:09:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558370574] [2023-11-06 22:09:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:11,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:09:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:09:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:11,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 187 [2023-11-06 22:09:11,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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) [2023-11-06 22:09:11,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:11,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 187 [2023-11-06 22:09:11,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:11,704 INFO L124 PetriNetUnfolderBase]: 136/276 cut-off events. [2023-11-06 22:09:11,705 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:09:11,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1073 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 546. Up to 211 conditions per place. [2023-11-06 22:09:11,708 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-11-06 22:09:11,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 226 flow [2023-11-06 22:09:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:09:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:09:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions. [2023-11-06 22:09:11,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040106951871658 [2023-11-06 22:09:11,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 377 transitions. [2023-11-06 22:09:11,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 377 transitions. [2023-11-06 22:09:11,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:11,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 377 transitions. [2023-11-06 22:09:11,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 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) [2023-11-06 22:09:11,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:09:11,721 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:09:11,721 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 94 flow. Second operand 4 states and 377 transitions. [2023-11-06 22:09:11,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 226 flow [2023-11-06 22:09:11,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 212 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:11,724 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 114 flow [2023-11-06 22:09:11,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-06 22:09:11,725 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2023-11-06 22:09:11,725 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 114 flow [2023-11-06 22:09:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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) [2023-11-06 22:09:11,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:11,726 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:11,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:11,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:11,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1624967051, now seen corresponding path program 1 times [2023-11-06 22:09:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409688410] [2023-11-06 22:09:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409688410] [2023-11-06 22:09:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409688410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235274144] [2023-11-06 22:09:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:12,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:12,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:09:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:12,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:09:12,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:12,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235274144] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:12,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-06 22:09:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996354383] [2023-11-06 22:09:12,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:09:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:09:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:09:12,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 187 [2023-11-06 22:09:12,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 114 flow. Second operand has 13 states, 13 states have (on average 85.38461538461539) internal successors, (1110), 13 states have internal predecessors, (1110), 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) [2023-11-06 22:09:12,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:12,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 187 [2023-11-06 22:09:12,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:12,440 INFO L124 PetriNetUnfolderBase]: 136/282 cut-off events. [2023-11-06 22:09:12,441 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-11-06 22:09:12,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1098 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 634. Up to 273 conditions per place. [2023-11-06 22:09:12,444 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-11-06 22:09:12,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 226 flow [2023-11-06 22:09:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:09:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 22:09:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1048 transitions. [2023-11-06 22:09:12,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46702317290552586 [2023-11-06 22:09:12,449 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1048 transitions. [2023-11-06 22:09:12,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1048 transitions. [2023-11-06 22:09:12,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:12,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1048 transitions. [2023-11-06 22:09:12,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.33333333333333) internal successors, (1048), 12 states have internal predecessors, (1048), 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) [2023-11-06 22:09:12,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 187.0) internal successors, (2431), 13 states have internal predecessors, (2431), 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) [2023-11-06 22:09:12,462 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 187.0) internal successors, (2431), 13 states have internal predecessors, (2431), 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) [2023-11-06 22:09:12,462 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 114 flow. Second operand 12 states and 1048 transitions. [2023-11-06 22:09:12,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 226 flow [2023-11-06 22:09:12,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:09:12,465 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 198 flow [2023-11-06 22:09:12,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-11-06 22:09:12,466 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-11-06 22:09:12,466 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 198 flow [2023-11-06 22:09:12,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.38461538461539) internal successors, (1110), 13 states have internal predecessors, (1110), 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) [2023-11-06 22:09:12,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:12,468 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:12,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:12,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:12,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -294638027, now seen corresponding path program 2 times [2023-11-06 22:09:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044558969] [2023-11-06 22:09:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044558969] [2023-11-06 22:09:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044558969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:13,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:13,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:09:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861546306] [2023-11-06 22:09:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:13,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:09:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:13,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:09:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:09:13,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 187 [2023-11-06 22:09:13,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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) [2023-11-06 22:09:13,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:13,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 187 [2023-11-06 22:09:13,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:13,219 INFO L124 PetriNetUnfolderBase]: 126/262 cut-off events. [2023-11-06 22:09:13,219 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-06 22:09:13,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 262 events. 126/262 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 968 event pairs, 32 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 592. Up to 209 conditions per place. [2023-11-06 22:09:13,222 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-11-06 22:09:13,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 329 flow [2023-11-06 22:09:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:09:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:09:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions. [2023-11-06 22:09:13,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49866310160427807 [2023-11-06 22:09:13,225 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions. [2023-11-06 22:09:13,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions. [2023-11-06 22:09:13,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:13,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions. [2023-11-06 22:09:13,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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) [2023-11-06 22:09:13,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:09:13,229 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:09:13,229 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 198 flow. Second operand 4 states and 373 transitions. [2023-11-06 22:09:13,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 329 flow [2023-11-06 22:09:13,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 281 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-06 22:09:13,238 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 182 flow [2023-11-06 22:09:13,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-06 22:09:13,241 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-11-06 22:09:13,241 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 182 flow [2023-11-06 22:09:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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) [2023-11-06 22:09:13,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:13,241 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:13,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:09:13,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:13,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash 328207332, now seen corresponding path program 1 times [2023-11-06 22:09:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954000209] [2023-11-06 22:09:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954000209] [2023-11-06 22:09:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954000209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:09:13,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433595925] [2023-11-06 22:09:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:13,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:09:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:13,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:09:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:09:13,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 187 [2023-11-06 22:09:13,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-11-06 22:09:13,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:13,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 187 [2023-11-06 22:09:13,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:13,460 INFO L124 PetriNetUnfolderBase]: 176/362 cut-off events. [2023-11-06 22:09:13,461 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-11-06 22:09:13,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 362 events. 176/362 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1484 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 906. Up to 219 conditions per place. [2023-11-06 22:09:13,465 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-06 22:09:13,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 360 flow [2023-11-06 22:09:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:09:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:09:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-11-06 22:09:13,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418894830659536 [2023-11-06 22:09:13,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-11-06 22:09:13,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-11-06 22:09:13,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:13,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-11-06 22:09:13,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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) [2023-11-06 22:09:13,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:13,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:13,474 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 182 flow. Second operand 3 states and 304 transitions. [2023-11-06 22:09:13,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 360 flow [2023-11-06 22:09:13,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:13,478 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 193 flow [2023-11-06 22:09:13,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-11-06 22:09:13,478 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2023-11-06 22:09:13,479 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 193 flow [2023-11-06 22:09:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-11-06 22:09:13,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:13,479 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:13,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:09:13,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:13,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 320646427, now seen corresponding path program 1 times [2023-11-06 22:09:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386719532] [2023-11-06 22:09:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386719532] [2023-11-06 22:09:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386719532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:13,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:09:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828579463] [2023-11-06 22:09:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:13,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:09:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:09:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:09:13,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 187 [2023-11-06 22:09:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2023-11-06 22:09:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:13,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 187 [2023-11-06 22:09:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:13,716 INFO L124 PetriNetUnfolderBase]: 238/486 cut-off events. [2023-11-06 22:09:13,716 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-11-06 22:09:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 486 events. 238/486 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2031 event pairs, 118 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1318. Up to 333 conditions per place. [2023-11-06 22:09:13,722 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-06 22:09:13,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 390 flow [2023-11-06 22:09:13,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:09:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:09:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-06 22:09:13,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311942959001783 [2023-11-06 22:09:13,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-06 22:09:13,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-06 22:09:13,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:13,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-06 22:09:13,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) [2023-11-06 22:09:13,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:13,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:09:13,728 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 193 flow. Second operand 3 states and 298 transitions. [2023-11-06 22:09:13,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 390 flow [2023-11-06 22:09:13,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:13,732 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 207 flow [2023-11-06 22:09:13,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-11-06 22:09:13,733 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 32 predicate places. [2023-11-06 22:09:13,733 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 207 flow [2023-11-06 22:09:13,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2023-11-06 22:09:13,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:13,734 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:13,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:09:13,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:13,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1918308732, now seen corresponding path program 1 times [2023-11-06 22:09:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4352042] [2023-11-06 22:09:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:14,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:14,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4352042] [2023-11-06 22:09:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4352042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:14,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:14,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:09:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184954346] [2023-11-06 22:09:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:14,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:09:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:14,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:09:14,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:14,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 187 [2023-11-06 22:09:14,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 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) [2023-11-06 22:09:14,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:14,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 187 [2023-11-06 22:09:14,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:14,693 INFO L124 PetriNetUnfolderBase]: 263/548 cut-off events. [2023-11-06 22:09:14,693 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2023-11-06 22:09:14,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 548 events. 263/548 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2441 event pairs, 109 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 1594. Up to 430 conditions per place. [2023-11-06 22:09:14,699 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 55 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2023-11-06 22:09:14,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 452 flow [2023-11-06 22:09:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:09:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:09:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 602 transitions. [2023-11-06 22:09:14,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45989304812834225 [2023-11-06 22:09:14,702 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 602 transitions. [2023-11-06 22:09:14,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 602 transitions. [2023-11-06 22:09:14,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:14,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 602 transitions. [2023-11-06 22:09:14,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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) [2023-11-06 22:09:14,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:14,710 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:14,710 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 207 flow. Second operand 7 states and 602 transitions. [2023-11-06 22:09:14,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 452 flow [2023-11-06 22:09:14,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:09:14,715 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 308 flow [2023-11-06 22:09:14,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-11-06 22:09:14,717 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 41 predicate places. [2023-11-06 22:09:14,717 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 308 flow [2023-11-06 22:09:14,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 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) [2023-11-06 22:09:14,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:14,718 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:14,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:09:14,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:14,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1433477851, now seen corresponding path program 1 times [2023-11-06 22:09:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142666986] [2023-11-06 22:09:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142666986] [2023-11-06 22:09:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142666986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:15,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:09:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118971275] [2023-11-06 22:09:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:15,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:15,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 187 [2023-11-06 22:09:15,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:15,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:15,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 187 [2023-11-06 22:09:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:15,559 INFO L124 PetriNetUnfolderBase]: 286/591 cut-off events. [2023-11-06 22:09:15,559 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2023-11-06 22:09:15,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 591 events. 286/591 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2657 event pairs, 90 based on Foata normal form. 17/504 useless extension candidates. Maximal degree in co-relation 1936. Up to 352 conditions per place. [2023-11-06 22:09:15,566 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 56 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2023-11-06 22:09:15,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 556 flow [2023-11-06 22:09:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:09:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:09:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-11-06 22:09:15,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721161191749427 [2023-11-06 22:09:15,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-11-06 22:09:15,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-11-06 22:09:15,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:15,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-11-06 22:09:15,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 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) [2023-11-06 22:09:15,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:15,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:15,580 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 308 flow. Second operand 7 states and 618 transitions. [2023-11-06 22:09:15,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 556 flow [2023-11-06 22:09:15,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 526 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-06 22:09:15,587 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 369 flow [2023-11-06 22:09:15,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-06 22:09:15,588 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 47 predicate places. [2023-11-06 22:09:15,588 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 369 flow [2023-11-06 22:09:15,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:15,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:15,589 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:15,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:09:15,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:15,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1440837872, now seen corresponding path program 2 times [2023-11-06 22:09:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345688045] [2023-11-06 22:09:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:16,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345688045] [2023-11-06 22:09:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345688045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:16,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:09:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401401378] [2023-11-06 22:09:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:16,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:09:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:09:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:16,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 187 [2023-11-06 22:09:16,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 369 flow. Second operand has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 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) [2023-11-06 22:09:16,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:16,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 187 [2023-11-06 22:09:16,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:16,652 INFO L124 PetriNetUnfolderBase]: 326/672 cut-off events. [2023-11-06 22:09:16,652 INFO L125 PetriNetUnfolderBase]: For 1429/1429 co-relation queries the response was YES. [2023-11-06 22:09:16,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 672 events. 326/672 cut-off events. For 1429/1429 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3192 event pairs, 81 based on Foata normal form. 14/575 useless extension candidates. Maximal degree in co-relation 2495. Up to 482 conditions per place. [2023-11-06 22:09:16,661 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 70 selfloop transitions, 27 changer transitions 0/97 dead transitions. [2023-11-06 22:09:16,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 775 flow [2023-11-06 22:09:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:09:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 932 transitions. [2023-11-06 22:09:16,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530870199319397 [2023-11-06 22:09:16,666 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 932 transitions. [2023-11-06 22:09:16,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 932 transitions. [2023-11-06 22:09:16,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:16,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 932 transitions. [2023-11-06 22:09:16,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.72727272727273) internal successors, (932), 11 states have internal predecessors, (932), 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) [2023-11-06 22:09:16,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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) [2023-11-06 22:09:16,676 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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) [2023-11-06 22:09:16,676 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 369 flow. Second operand 11 states and 932 transitions. [2023-11-06 22:09:16,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 775 flow [2023-11-06 22:09:16,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 743 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:09:16,684 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 531 flow [2023-11-06 22:09:16,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=531, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2023-11-06 22:09:16,685 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2023-11-06 22:09:16,685 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 531 flow [2023-11-06 22:09:16,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 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) [2023-11-06 22:09:16,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:16,686 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:16,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:09:16,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:16,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1440837871, now seen corresponding path program 2 times [2023-11-06 22:09:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593787591] [2023-11-06 22:09:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593787591] [2023-11-06 22:09:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593787591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:09:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41007306] [2023-11-06 22:09:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:17,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:17,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 187 [2023-11-06 22:09:17,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 531 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:17,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:17,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 187 [2023-11-06 22:09:17,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:17,570 INFO L124 PetriNetUnfolderBase]: 406/813 cut-off events. [2023-11-06 22:09:17,570 INFO L125 PetriNetUnfolderBase]: For 3268/3268 co-relation queries the response was YES. [2023-11-06 22:09:17,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 813 events. 406/813 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3962 event pairs, 57 based on Foata normal form. 32/718 useless extension candidates. Maximal degree in co-relation 3353. Up to 339 conditions per place. [2023-11-06 22:09:17,582 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 74 selfloop transitions, 33 changer transitions 0/107 dead transitions. [2023-11-06 22:09:17,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 961 flow [2023-11-06 22:09:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:09:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:09:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 798 transitions. [2023-11-06 22:09:17,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741532976827095 [2023-11-06 22:09:17,586 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 798 transitions. [2023-11-06 22:09:17,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 798 transitions. [2023-11-06 22:09:17,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:17,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 798 transitions. [2023-11-06 22:09:17,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 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) [2023-11-06 22:09:17,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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) [2023-11-06 22:09:17,594 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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) [2023-11-06 22:09:17,595 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 531 flow. Second operand 9 states and 798 transitions. [2023-11-06 22:09:17,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 961 flow [2023-11-06 22:09:17,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 107 transitions, 874 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-06 22:09:17,612 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 624 flow [2023-11-06 22:09:17,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=624, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2023-11-06 22:09:17,615 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 63 predicate places. [2023-11-06 22:09:17,615 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 624 flow [2023-11-06 22:09:17,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:17,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:17,616 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:17,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:09:17,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:17,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1438846237, now seen corresponding path program 1 times [2023-11-06 22:09:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391547792] [2023-11-06 22:09:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:18,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391547792] [2023-11-06 22:09:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391547792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:09:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596389499] [2023-11-06 22:09:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:18,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:09:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:09:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:18,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 187 [2023-11-06 22:09:18,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 624 flow. Second operand has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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) [2023-11-06 22:09:18,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:18,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 187 [2023-11-06 22:09:18,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:18,601 INFO L124 PetriNetUnfolderBase]: 424/863 cut-off events. [2023-11-06 22:09:18,602 INFO L125 PetriNetUnfolderBase]: For 4449/4449 co-relation queries the response was YES. [2023-11-06 22:09:18,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 863 events. 424/863 cut-off events. For 4449/4449 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4389 event pairs, 146 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 4022. Up to 712 conditions per place. [2023-11-06 22:09:18,615 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 82 selfloop transitions, 27 changer transitions 0/109 dead transitions. [2023-11-06 22:09:18,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 1182 flow [2023-11-06 22:09:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:09:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:09:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 669 transitions. [2023-11-06 22:09:18,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44719251336898397 [2023-11-06 22:09:18,619 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 669 transitions. [2023-11-06 22:09:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 669 transitions. [2023-11-06 22:09:18,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:18,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 669 transitions. [2023-11-06 22:09:18,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 83.625) internal successors, (669), 8 states have internal predecessors, (669), 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) [2023-11-06 22:09:18,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 187.0) internal successors, (1683), 9 states have internal predecessors, (1683), 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) [2023-11-06 22:09:18,626 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 187.0) internal successors, (1683), 9 states have internal predecessors, (1683), 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) [2023-11-06 22:09:18,626 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 624 flow. Second operand 8 states and 669 transitions. [2023-11-06 22:09:18,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 1182 flow [2023-11-06 22:09:18,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 1136 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-06 22:09:18,646 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 860 flow [2023-11-06 22:09:18,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=860, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2023-11-06 22:09:18,647 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 70 predicate places. [2023-11-06 22:09:18,647 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 860 flow [2023-11-06 22:09:18,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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) [2023-11-06 22:09:18,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:18,650 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:18,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:09:18,650 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:18,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1438846248, now seen corresponding path program 1 times [2023-11-06 22:09:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290295493] [2023-11-06 22:09:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290295493] [2023-11-06 22:09:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290295493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:19,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:09:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727937458] [2023-11-06 22:09:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:19,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:19,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 187 [2023-11-06 22:09:19,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 860 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:19,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:19,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 187 [2023-11-06 22:09:19,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:19,557 INFO L124 PetriNetUnfolderBase]: 463/931 cut-off events. [2023-11-06 22:09:19,557 INFO L125 PetriNetUnfolderBase]: For 5717/5717 co-relation queries the response was YES. [2023-11-06 22:09:19,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 931 events. 463/931 cut-off events. For 5717/5717 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4904 event pairs, 101 based on Foata normal form. 21/864 useless extension candidates. Maximal degree in co-relation 4670. Up to 593 conditions per place. [2023-11-06 22:09:19,571 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 90 selfloop transitions, 29 changer transitions 0/119 dead transitions. [2023-11-06 22:09:19,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 119 transitions, 1437 flow [2023-11-06 22:09:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:09:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:09:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-11-06 22:09:19,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721161191749427 [2023-11-06 22:09:19,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-11-06 22:09:19,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-11-06 22:09:19,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:19,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-11-06 22:09:19,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 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) [2023-11-06 22:09:19,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:19,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 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) [2023-11-06 22:09:19,582 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 860 flow. Second operand 7 states and 618 transitions. [2023-11-06 22:09:19,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 119 transitions, 1437 flow [2023-11-06 22:09:19,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 1390 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-06 22:09:19,606 INFO L231 Difference]: Finished difference. Result has 101 places, 89 transitions, 960 flow [2023-11-06 22:09:19,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=960, PETRI_PLACES=101, PETRI_TRANSITIONS=89} [2023-11-06 22:09:19,607 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2023-11-06 22:09:19,607 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 960 flow [2023-11-06 22:09:19,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:19,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:19,608 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:09:19,609 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:19,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1435483357, now seen corresponding path program 2 times [2023-11-06 22:09:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650086717] [2023-11-06 22:09:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650086717] [2023-11-06 22:09:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650086717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:19,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:09:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833536304] [2023-11-06 22:09:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:19,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:09:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:09:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:20,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 187 [2023-11-06 22:09:20,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 960 flow. Second operand has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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) [2023-11-06 22:09:20,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:20,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 187 [2023-11-06 22:09:20,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:20,628 INFO L124 PetriNetUnfolderBase]: 451/913 cut-off events. [2023-11-06 22:09:20,629 INFO L125 PetriNetUnfolderBase]: For 6527/6527 co-relation queries the response was YES. [2023-11-06 22:09:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 913 events. 451/913 cut-off events. For 6527/6527 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4703 event pairs, 144 based on Foata normal form. 12/837 useless extension candidates. Maximal degree in co-relation 4971. Up to 711 conditions per place. [2023-11-06 22:09:20,644 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 88 selfloop transitions, 38 changer transitions 0/126 dead transitions. [2023-11-06 22:09:20,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 126 transitions, 1509 flow [2023-11-06 22:09:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:09:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 908 transitions. [2023-11-06 22:09:20,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4414195430238211 [2023-11-06 22:09:20,649 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 908 transitions. [2023-11-06 22:09:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 908 transitions. [2023-11-06 22:09:20,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:20,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 908 transitions. [2023-11-06 22:09:20,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 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) [2023-11-06 22:09:20,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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) [2023-11-06 22:09:20,658 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 187.0) internal successors, (2244), 12 states have internal predecessors, (2244), 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) [2023-11-06 22:09:20,659 INFO L175 Difference]: Start difference. First operand has 101 places, 89 transitions, 960 flow. Second operand 11 states and 908 transitions. [2023-11-06 22:09:20,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 126 transitions, 1509 flow [2023-11-06 22:09:20,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 1462 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:09:20,686 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 1118 flow [2023-11-06 22:09:20,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1118, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2023-11-06 22:09:20,688 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 84 predicate places. [2023-11-06 22:09:20,688 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 1118 flow [2023-11-06 22:09:20,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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) [2023-11-06 22:09:20,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:20,689 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:20,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:09:20,689 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:20,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1435483368, now seen corresponding path program 2 times [2023-11-06 22:09:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360084431] [2023-11-06 22:09:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360084431] [2023-11-06 22:09:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360084431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:09:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752240068] [2023-11-06 22:09:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:21,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:21,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 187 [2023-11-06 22:09:21,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 1118 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:21,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:21,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 187 [2023-11-06 22:09:21,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:21,663 INFO L124 PetriNetUnfolderBase]: 494/980 cut-off events. [2023-11-06 22:09:21,663 INFO L125 PetriNetUnfolderBase]: For 8865/8865 co-relation queries the response was YES. [2023-11-06 22:09:21,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 980 events. 494/980 cut-off events. For 8865/8865 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5060 event pairs, 78 based on Foata normal form. 33/917 useless extension candidates. Maximal degree in co-relation 5715. Up to 465 conditions per place. [2023-11-06 22:09:21,680 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 87 selfloop transitions, 48 changer transitions 0/135 dead transitions. [2023-11-06 22:09:21,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 1713 flow [2023-11-06 22:09:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:09:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:09:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 796 transitions. [2023-11-06 22:09:21,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47296494355317886 [2023-11-06 22:09:21,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 796 transitions. [2023-11-06 22:09:21,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 796 transitions. [2023-11-06 22:09:21,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:21,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 796 transitions. [2023-11-06 22:09:21,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 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) [2023-11-06 22:09:21,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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) [2023-11-06 22:09:21,697 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 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) [2023-11-06 22:09:21,697 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 1118 flow. Second operand 9 states and 796 transitions. [2023-11-06 22:09:21,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 1713 flow [2023-11-06 22:09:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 1664 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-06 22:09:21,734 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 1279 flow [2023-11-06 22:09:21,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2023-11-06 22:09:21,735 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 92 predicate places. [2023-11-06 22:09:21,735 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 1279 flow [2023-11-06 22:09:21,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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) [2023-11-06 22:09:21,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:21,736 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:21,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:09:21,737 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:21,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1096405078, now seen corresponding path program 1 times [2023-11-06 22:09:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692155923] [2023-11-06 22:09:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692155923] [2023-11-06 22:09:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692155923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:22,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221175239] [2023-11-06 22:09:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:22,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:22,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:22,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:09:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:22,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:09:22,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:22,284 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:09:22,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:22,366 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-06 22:09:22,440 INFO L351 Elim1Store]: Elim1 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 22 treesize of output 17 [2023-11-06 22:09:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:27,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:31,391 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_59| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_39| (+ |c_#StackHeapBarrier| 1)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_493) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_59| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) is different from false [2023-11-06 22:09:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221175239] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:31,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-11-06 22:09:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857578811] [2023-11-06 22:09:31,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:31,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:09:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:31,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:09:31,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=218, Unknown=6, NotChecked=32, Total=342 [2023-11-06 22:09:31,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 187 [2023-11-06 22:09:31,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 1279 flow. Second operand has 19 states, 19 states have (on average 67.63157894736842) internal successors, (1285), 19 states have internal predecessors, (1285), 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) [2023-11-06 22:09:31,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:31,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 187 [2023-11-06 22:09:31,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:33,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:35,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:37,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:39,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:40,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:41,899 INFO L124 PetriNetUnfolderBase]: 474/941 cut-off events. [2023-11-06 22:09:41,899 INFO L125 PetriNetUnfolderBase]: For 10423/10423 co-relation queries the response was YES. [2023-11-06 22:09:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 941 events. 474/941 cut-off events. For 10423/10423 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4764 event pairs, 114 based on Foata normal form. 19/864 useless extension candidates. Maximal degree in co-relation 5973. Up to 661 conditions per place. [2023-11-06 22:09:41,917 INFO L140 encePairwiseOnDemand]: 175/187 looper letters, 126 selfloop transitions, 58 changer transitions 0/184 dead transitions. [2023-11-06 22:09:41,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 184 transitions, 2541 flow [2023-11-06 22:09:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:09:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-06 22:09:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 958 transitions. [2023-11-06 22:09:41,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39407651172357056 [2023-11-06 22:09:41,921 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 958 transitions. [2023-11-06 22:09:41,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 958 transitions. [2023-11-06 22:09:41,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:41,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 958 transitions. [2023-11-06 22:09:41,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.6923076923077) internal successors, (958), 13 states have internal predecessors, (958), 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) [2023-11-06 22:09:41,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 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) [2023-11-06 22:09:41,931 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 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) [2023-11-06 22:09:41,931 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 1279 flow. Second operand 13 states and 958 transitions. [2023-11-06 22:09:41,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 184 transitions, 2541 flow [2023-11-06 22:09:41,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 184 transitions, 2459 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-06 22:09:41,973 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 1860 flow [2023-11-06 22:09:41,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1860, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2023-11-06 22:09:41,974 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 107 predicate places. [2023-11-06 22:09:41,974 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 1860 flow [2023-11-06 22:09:41,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 67.63157894736842) internal successors, (1285), 19 states have internal predecessors, (1285), 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) [2023-11-06 22:09:41,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:41,975 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:41,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:42,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:09:42,182 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:09:42,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1874653664, now seen corresponding path program 1 times [2023-11-06 22:09:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604275806] [2023-11-06 22:09:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604275806] [2023-11-06 22:09:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604275806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117366893] [2023-11-06 22:09:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:42,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:42,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:09:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:42,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:09:42,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:42,678 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:09:42,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:42,764 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-06 22:09:42,859 INFO L351 Elim1Store]: Elim1 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 22 treesize of output 17 [2023-11-06 22:09:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:48,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:09:52,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117366893] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:52,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:52,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-11-06 22:09:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45285587] [2023-11-06 22:09:52,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:52,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:09:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:09:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=246, Unknown=9, NotChecked=0, Total=342 [2023-11-06 22:09:54,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:56,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:09:58,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:00,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:02,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:03,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:05,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:07,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:09,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:11,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:13,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:14,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:16,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:18,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:20,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:21,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:23,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:23,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 187 [2023-11-06 22:10:23,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 1860 flow. Second operand has 19 states, 19 states have (on average 69.63157894736842) internal successors, (1323), 19 states have internal predecessors, (1323), 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) [2023-11-06 22:10:23,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:23,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 187 [2023-11-06 22:10:23,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:25,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:27,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:29,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:31,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:32,065 INFO L124 PetriNetUnfolderBase]: 454/902 cut-off events. [2023-11-06 22:10:32,066 INFO L125 PetriNetUnfolderBase]: For 10892/10892 co-relation queries the response was YES. [2023-11-06 22:10:32,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6119 conditions, 902 events. 454/902 cut-off events. For 10892/10892 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4518 event pairs, 94 based on Foata normal form. 19/836 useless extension candidates. Maximal degree in co-relation 6020. Up to 591 conditions per place. [2023-11-06 22:10:32,094 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 154 selfloop transitions, 58 changer transitions 0/212 dead transitions. [2023-11-06 22:10:32,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 212 transitions, 3246 flow [2023-11-06 22:10:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:10:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-06 22:10:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 983 transitions. [2023-11-06 22:10:32,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043603455368161 [2023-11-06 22:10:32,097 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 983 transitions. [2023-11-06 22:10:32,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 983 transitions. [2023-11-06 22:10:32,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:32,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 983 transitions. [2023-11-06 22:10:32,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 75.61538461538461) internal successors, (983), 13 states have internal predecessors, (983), 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) [2023-11-06 22:10:32,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 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) [2023-11-06 22:10:32,125 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 187.0) internal successors, (2618), 14 states have internal predecessors, (2618), 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) [2023-11-06 22:10:32,125 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 1860 flow. Second operand 13 states and 983 transitions. [2023-11-06 22:10:32,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 212 transitions, 3246 flow [2023-11-06 22:10:32,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 212 transitions, 3114 flow, removed 38 selfloop flow, removed 3 redundant places. [2023-11-06 22:10:32,174 INFO L231 Difference]: Finished difference. Result has 149 places, 154 transitions, 2305 flow [2023-11-06 22:10:32,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2305, PETRI_PLACES=149, PETRI_TRANSITIONS=154} [2023-11-06 22:10:32,175 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 122 predicate places. [2023-11-06 22:10:32,175 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 154 transitions, 2305 flow [2023-11-06 22:10:32,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 69.63157894736842) internal successors, (1323), 19 states have internal predecessors, (1323), 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) [2023-11-06 22:10:32,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:32,176 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:32,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:32,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:10:32,382 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:10:32,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1378343600, now seen corresponding path program 1 times [2023-11-06 22:10:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901032782] [2023-11-06 22:10:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:32,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901032782] [2023-11-06 22:10:32,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901032782] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024883118] [2023-11-06 22:10:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:32,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:32,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:32,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:10:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:32,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:32,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:32,618 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024883118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:10:32,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-06 22:10:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136318782] [2023-11-06 22:10:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:32,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:32,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:32,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 187 [2023-11-06 22:10:32,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 154 transitions, 2305 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-11-06 22:10:32,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:32,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 187 [2023-11-06 22:10:32,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:32,936 INFO L124 PetriNetUnfolderBase]: 429/853 cut-off events. [2023-11-06 22:10:32,936 INFO L125 PetriNetUnfolderBase]: For 11261/11261 co-relation queries the response was YES. [2023-11-06 22:10:32,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6038 conditions, 853 events. 429/853 cut-off events. For 11261/11261 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4187 event pairs, 118 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 5932. Up to 449 conditions per place. [2023-11-06 22:10:32,949 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 190 selfloop transitions, 8 changer transitions 0/198 dead transitions. [2023-11-06 22:10:32,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 198 transitions, 3240 flow [2023-11-06 22:10:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-11-06 22:10:32,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213903743315508 [2023-11-06 22:10:32,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-11-06 22:10:32,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-11-06 22:10:32,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:32,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-11-06 22:10:32,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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) [2023-11-06 22:10:32,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:10:32,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:10:32,954 INFO L175 Difference]: Start difference. First operand has 149 places, 154 transitions, 2305 flow. Second operand 4 states and 390 transitions. [2023-11-06 22:10:32,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 198 transitions, 3240 flow [2023-11-06 22:10:33,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 198 transitions, 3062 flow, removed 51 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:33,015 INFO L231 Difference]: Finished difference. Result has 147 places, 152 transitions, 2142 flow [2023-11-06 22:10:33,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2142, PETRI_PLACES=147, PETRI_TRANSITIONS=152} [2023-11-06 22:10:33,016 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 120 predicate places. [2023-11-06 22:10:33,016 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 152 transitions, 2142 flow [2023-11-06 22:10:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-11-06 22:10:33,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:33,017 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:33,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:33,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:33,223 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:10:33,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1378343591, now seen corresponding path program 1 times [2023-11-06 22:10:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105413324] [2023-11-06 22:10:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-06 22:10:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105413324] [2023-11-06 22:10:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105413324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338344961] [2023-11-06 22:10:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:33,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:33,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:33,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 187 [2023-11-06 22:10:33,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 152 transitions, 2142 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2023-11-06 22:10:33,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:33,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 187 [2023-11-06 22:10:33,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:33,563 INFO L124 PetriNetUnfolderBase]: 404/804 cut-off events. [2023-11-06 22:10:33,563 INFO L125 PetriNetUnfolderBase]: For 10162/10162 co-relation queries the response was YES. [2023-11-06 22:10:33,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 804 events. 404/804 cut-off events. For 10162/10162 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3893 event pairs, 115 based on Foata normal form. 11/782 useless extension candidates. Maximal degree in co-relation 5469. Up to 630 conditions per place. [2023-11-06 22:10:33,575 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 165 selfloop transitions, 10 changer transitions 0/175 dead transitions. [2023-11-06 22:10:33,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 2742 flow [2023-11-06 22:10:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-11-06 22:10:33,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2023-11-06 22:10:33,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-11-06 22:10:33,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-11-06 22:10:33,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:33,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-11-06 22:10:33,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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) [2023-11-06 22:10:33,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:10:33,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:10:33,581 INFO L175 Difference]: Start difference. First operand has 147 places, 152 transitions, 2142 flow. Second operand 3 states and 286 transitions. [2023-11-06 22:10:33,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 2742 flow [2023-11-06 22:10:33,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 175 transitions, 2732 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:33,641 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 2102 flow [2023-11-06 22:10:33,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2023-11-06 22:10:33,644 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 119 predicate places. [2023-11-06 22:10:33,644 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 2102 flow [2023-11-06 22:10:33,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2023-11-06 22:10:33,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:33,645 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:10:33,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:10:33,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1950825558, now seen corresponding path program 1 times [2023-11-06 22:10:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952990576] [2023-11-06 22:10:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952990576] [2023-11-06 22:10:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952990576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120264349] [2023-11-06 22:10:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:33,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:33,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:10:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:33,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:33,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:33,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120264349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:33,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:10:33,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-06 22:10:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939389382] [2023-11-06 22:10:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:33,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:33,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 187 [2023-11-06 22:10:33,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 2102 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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) [2023-11-06 22:10:33,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:33,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 187 [2023-11-06 22:10:33,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:34,206 INFO L124 PetriNetUnfolderBase]: 381/759 cut-off events. [2023-11-06 22:10:34,207 INFO L125 PetriNetUnfolderBase]: For 9958/9958 co-relation queries the response was YES. [2023-11-06 22:10:34,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 759 events. 381/759 cut-off events. For 9958/9958 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3589 event pairs, 108 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 5237. Up to 468 conditions per place. [2023-11-06 22:10:34,215 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 173 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2023-11-06 22:10:34,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 178 transitions, 2844 flow [2023-11-06 22:10:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-11-06 22:10:34,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-06 22:10:34,217 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-11-06 22:10:34,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-11-06 22:10:34,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:34,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-11-06 22:10:34,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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) [2023-11-06 22:10:34,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:10:34,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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) [2023-11-06 22:10:34,221 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 2102 flow. Second operand 4 states and 391 transitions. [2023-11-06 22:10:34,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 178 transitions, 2844 flow [2023-11-06 22:10:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 178 transitions, 2823 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:34,276 INFO L231 Difference]: Finished difference. Result has 147 places, 146 transitions, 2075 flow [2023-11-06 22:10:34,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2075, PETRI_PLACES=147, PETRI_TRANSITIONS=146} [2023-11-06 22:10:34,277 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 120 predicate places. [2023-11-06 22:10:34,277 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 2075 flow [2023-11-06 22:10:34,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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) [2023-11-06 22:10:34,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:34,278 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:34,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:10:34,484 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:10:34,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1950825557, now seen corresponding path program 1 times [2023-11-06 22:10:34,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:34,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500012344] [2023-11-06 22:10:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-06 22:10:34,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:34,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500012344] [2023-11-06 22:10:34,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500012344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:34,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:34,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125803736] [2023-11-06 22:10:34,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:34,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:34,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 187 [2023-11-06 22:10:34,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 2075 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-11-06 22:10:34,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:34,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 187 [2023-11-06 22:10:34,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:34,794 INFO L124 PetriNetUnfolderBase]: 358/714 cut-off events. [2023-11-06 22:10:34,795 INFO L125 PetriNetUnfolderBase]: For 9634/9634 co-relation queries the response was YES. [2023-11-06 22:10:34,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 714 events. 358/714 cut-off events. For 9634/9634 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3357 event pairs, 91 based on Foata normal form. 11/725 useless extension candidates. Maximal degree in co-relation 4886. Up to 552 conditions per place. [2023-11-06 22:10:34,805 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 158 selfloop transitions, 10 changer transitions 0/168 dead transitions. [2023-11-06 22:10:34,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 168 transitions, 2682 flow [2023-11-06 22:10:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-11-06 22:10:34,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133689839572193 [2023-11-06 22:10:34,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-11-06 22:10:34,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-11-06 22:10:34,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:34,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-11-06 22:10:34,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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) [2023-11-06 22:10:34,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:10:34,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-06 22:10:34,811 INFO L175 Difference]: Start difference. First operand has 147 places, 146 transitions, 2075 flow. Second operand 3 states and 288 transitions. [2023-11-06 22:10:34,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 168 transitions, 2682 flow [2023-11-06 22:10:34,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 168 transitions, 2675 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:34,866 INFO L231 Difference]: Finished difference. Result has 146 places, 142 transitions, 2052 flow [2023-11-06 22:10:34,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2052, PETRI_PLACES=146, PETRI_TRANSITIONS=142} [2023-11-06 22:10:34,867 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 119 predicate places. [2023-11-06 22:10:34,867 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 142 transitions, 2052 flow [2023-11-06 22:10:34,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-11-06 22:10:34,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:34,868 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:34,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:10:34,868 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:10:34,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 239133286, now seen corresponding path program 1 times [2023-11-06 22:10:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544996442] [2023-11-06 22:10:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544996442] [2023-11-06 22:10:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544996442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284377276] [2023-11-06 22:10:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:35,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:35,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:10:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:35,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:10:35,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:35,701 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:10:35,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:35,831 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-06 22:10:36,028 INFO L351 Elim1Store]: Elim1 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 22 treesize of output 17 [2023-11-06 22:10:36,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-06 22:10:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:36,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:10:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284377276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:37,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:37,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-06 22:10:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757984999] [2023-11-06 22:10:37,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:37,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 22:10:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:10:37,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=808, Unknown=1, NotChecked=0, Total=992 [2023-11-06 22:10:38,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 187 [2023-11-06 22:10:38,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 142 transitions, 2052 flow. Second operand has 32 states, 32 states have (on average 56.40625) internal successors, (1805), 32 states have internal predecessors, (1805), 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) [2023-11-06 22:10:38,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:38,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 187 [2023-11-06 22:10:38,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:38,790 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0) (< |v_ULTIMATE.start_main_~#t1~0#1.base_41| (+ |c_#StackHeapBarrier| 1)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| Int) (v_ArrVal_865 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_865 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))))) is different from false [2023-11-06 22:10:42,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:43,225 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_41| (+ |c_#StackHeapBarrier| 1)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| Int) (v_ArrVal_865 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (let ((.cse2 (select |c_#memory_int| 1))) (= (store ((as const (Array Int Int)) 0) 0 (select .cse2 0)) .cse2)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| Int) (v_ArrVal_865 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| 1))) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-11-06 22:10:43,265 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_865 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_41| (+ |c_#StackHeapBarrier| 1)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (let ((.cse1 (select |c_#memory_int| 1))) (= (store ((as const (Array Int Int)) 0) 0 (select .cse1 0)) .cse1)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_865 Int)) (or (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_865)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))))) is different from false [2023-11-06 22:10:47,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:10:47,992 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_41| (+ |c_#StackHeapBarrier| 1)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| Int) (v_ArrVal_865 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (let ((.cse2 (select |c_#memory_int| 1))) (= (store ((as const (Array Int Int)) 0) 0 (select .cse2 0)) .cse2)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| Int) (v_ArrVal_865 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_64| 1))) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-11-06 22:10:58,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:01,373 INFO L124 PetriNetUnfolderBase]: 917/1760 cut-off events. [2023-11-06 22:11:01,374 INFO L125 PetriNetUnfolderBase]: For 27659/27659 co-relation queries the response was YES. [2023-11-06 22:11:01,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12761 conditions, 1760 events. 917/1760 cut-off events. For 27659/27659 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10237 event pairs, 116 based on Foata normal form. 52/1812 useless extension candidates. Maximal degree in co-relation 12654. Up to 798 conditions per place. [2023-11-06 22:11:01,396 INFO L140 encePairwiseOnDemand]: 170/187 looper letters, 307 selfloop transitions, 307 changer transitions 2/616 dead transitions. [2023-11-06 22:11:01,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 616 transitions, 9749 flow [2023-11-06 22:11:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-06 22:11:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-06 22:11:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 4163 transitions. [2023-11-06 22:11:01,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3226381461675579 [2023-11-06 22:11:01,405 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 4163 transitions. [2023-11-06 22:11:01,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 4163 transitions. [2023-11-06 22:11:01,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:01,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 4163 transitions. [2023-11-06 22:11:01,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 60.333333333333336) internal successors, (4163), 69 states have internal predecessors, (4163), 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) [2023-11-06 22:11:01,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 187.0) internal successors, (13090), 70 states have internal predecessors, (13090), 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) [2023-11-06 22:11:01,438 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 187.0) internal successors, (13090), 70 states have internal predecessors, (13090), 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) [2023-11-06 22:11:01,439 INFO L175 Difference]: Start difference. First operand has 146 places, 142 transitions, 2052 flow. Second operand 69 states and 4163 transitions. [2023-11-06 22:11:01,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 616 transitions, 9749 flow [2023-11-06 22:11:01,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 616 transitions, 9667 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 22:11:01,564 INFO L231 Difference]: Finished difference. Result has 251 places, 451 transitions, 7985 flow [2023-11-06 22:11:01,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=7985, PETRI_PLACES=251, PETRI_TRANSITIONS=451} [2023-11-06 22:11:01,565 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 224 predicate places. [2023-11-06 22:11:01,566 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 451 transitions, 7985 flow [2023-11-06 22:11:01,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 56.40625) internal successors, (1805), 32 states have internal predecessors, (1805), 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) [2023-11-06 22:11:01,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:01,567 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:01,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:01,780 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-11-06 22:11:01,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1672286859, now seen corresponding path program 1 times [2023-11-06 22:11:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066154469] [2023-11-06 22:11:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:11:02,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066154469] [2023-11-06 22:11:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066154469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985774585] [2023-11-06 22:11:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:02,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:02,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:02,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:02,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec63e24a-504d-4cd3-89ae-874ce349c2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:11:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:02,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:11:02,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:02,720 INFO L351 Elim1Store]: Elim1 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 [2023-11-06 22:11:02,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:02,842 INFO L351 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-06 22:11:03,071 INFO L351 Elim1Store]: Elim1 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 35 treesize of output 28 [2023-11-06 22:11:03,257 INFO L351 Elim1Store]: Elim1 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 41 treesize of output 32 [2023-11-06 22:11:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:11:03,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:11:12,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985774585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:12,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:12,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-11-06 22:11:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200846285] [2023-11-06 22:11:12,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:12,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:11:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:12,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:11:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=903, Unknown=5, NotChecked=0, Total=1122 [2023-11-06 22:11:14,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:17,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:19,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:21,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:25,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:28,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:30,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:34,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:37,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:39,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:41,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:43,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:43,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 187 [2023-11-06 22:11:43,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 451 transitions, 7985 flow. Second operand has 34 states, 34 states have (on average 54.3235294117647) internal successors, (1847), 34 states have internal predecessors, (1847), 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) [2023-11-06 22:11:43,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:43,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 187 [2023-11-06 22:11:43,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:44,344 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (= ((as const (Array Int Int)) 0) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (let ((.cse1 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_941) |c_~#cache~0.base|))) (or (< (select (store (store .cse1 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_main_~#t1~0#1.base_42| (+ |c_#StackHeapBarrier| 1)) (< (select .cse1 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-11-06 22:11:44,575 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ 28 |c_~#cache~0.offset|))) (and (<= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (or (< (select .cse1 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| .cse2) (< (select (store (store .cse1 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647)))) (= ((as const (Array Int Int)) 0) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_941) |c_~#cache~0.base|))) (or (< (select (store (store .cse3 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_main_~#t1~0#1.base_42| (+ |c_#StackHeapBarrier| 1)) (< (select .cse3 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| .cse2)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-11-06 22:11:48,161 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| 1))) (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse2 (select .cse1 0))) (let ((.cse0 (store .cse3 0 .cse2))) (and (exists ((|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (store .cse0 |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (select .cse1 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse1))) (<= .cse2 (+ (select .cse3 0) 1)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= .cse0 .cse1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_941) |c_~#cache~0.base|))) (or (< (select (store (store .cse4 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_main_~#t1~0#1.base_42| (+ |c_#StackHeapBarrier| 1)) (< (select .cse4 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|))))))))) is different from false [2023-11-06 22:11:50,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:56,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:11:57,475 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse5 (@diff .cse4 .cse1)) (.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse0 (@diff .cse2 .cse1))) (and (or (< (+ .cse0 27) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~mem31#1| 0) (= .cse1 (store .cse2 .cse0 0)) (< (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (or (< (select .cse2 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| .cse3) (< (select (store (store .cse2 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647))) (= .cse1 (store .cse4 .cse5 0)) (or (= .cse1 .cse4) (and (<= (select .cse4 .cse5) 1) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse5)))) (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| Int)) (let ((.cse6 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_941) |c_~#cache~0.base|))) (or (< (select (store (store .cse6 |c_~#cache~0.offset| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_66| 1)) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_main_~#t1~0#1.base_42| (+ |c_#StackHeapBarrier| 1)) (< (select .cse6 |c_~#cache~0.offset|) |v_ULTIMATE.start_cache_entry_addref_#t~post32#1_69|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| .cse3)))) (<= (select .cse2 .cse0) 1) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false