./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/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_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8 --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:12:27,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:12:27,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:12:27,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:12:27,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:12:27,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:12:27,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:12:27,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:12:27,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:12:27,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:12:27,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:12:27,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:12:27,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:12:27,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:12:27,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:12:27,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:12:27,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:12:27,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:12:27,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:12:27,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:12:27,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:12:27,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:12:27,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:12:27,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:12:27,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:12:27,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:12:27,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:12:27,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:12:27,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:12:27,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:12:27,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:12:27,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:12:27,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:12:27,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:12:27,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:12:27,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:12:27,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:12:27,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:12:27,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:12:27,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:12:27,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:12:27,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:12:27,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:12:27,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:12:27,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:12:27,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:12:27,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:12:27,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:12:27,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:12:27,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:12:27,866 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:12:27,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:12:27,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:12:27,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:12:27,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:12:27,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:12:27,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:12:27,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:12:27,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:12:27,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:12:27,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:12:27,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:12:27,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:12:27,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:12:27,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:12:27,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:12:27,870 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:12:27,870 INFO L138 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_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/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_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8 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 [2022-12-13 13:12:28,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:12:28,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:12:28,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:12:28,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:12:28,073 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:12:28,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-12-13 13:12:30,516 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:12:30,704 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:12:30,704 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-12-13 13:12:30,714 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/data/22dd3fb9e/734b779ef9054fdeb00050146d1adab5/FLAG8ce77440c [2022-12-13 13:12:31,090 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/data/22dd3fb9e/734b779ef9054fdeb00050146d1adab5 [2022-12-13 13:12:31,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:12:31,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:12:31,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:12:31,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:12:31,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:12:31,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604bc51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31, skipping insertion in model container [2022-12-13 13:12:31,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:12:31,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:12:31,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:12:31,404 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:12:31,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:12:31,462 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:12:31,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31 WrapperNode [2022-12-13 13:12:31,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:12:31,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:12:31,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:12:31,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:12:31,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,494 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-12-13 13:12:31,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:12:31,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:12:31,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:12:31,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:12:31,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,513 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:12:31,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:12:31,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:12:31,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:12:31,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (1/1) ... [2022-12-13 13:12:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:12:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:31,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:12:31,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:12:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:12:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 13:12:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 13:12:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:12:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:12:31,579 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:12:31,682 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:12:31,684 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:12:31,831 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:12:31,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:12:31,836 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:12:31,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:12:31 BoogieIcfgContainer [2022-12-13 13:12:31,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:12:31,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:12:31,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:12:31,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:12:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:12:31" (1/3) ... [2022-12-13 13:12:31,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b81fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:12:31, skipping insertion in model container [2022-12-13 13:12:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:12:31" (2/3) ... [2022-12-13 13:12:31,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b81fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:12:31, skipping insertion in model container [2022-12-13 13:12:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:12:31" (3/3) ... [2022-12-13 13:12:31,845 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-12-13 13:12:31,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:12:31,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:12:31,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-12-13 13:12:31,860 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:12:31,915 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:12:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 201 flow [2022-12-13 13:12:31,984 INFO L130 PetriNetUnfolder]: 6/97 cut-off events. [2022-12-13 13:12:31,984 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:31,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 6/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 13:12:31,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 98 transitions, 201 flow [2022-12-13 13:12:31,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 197 flow [2022-12-13 13:12:31,996 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:12:32,006 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 97 transitions, 197 flow [2022-12-13 13:12:32,008 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 97 transitions, 197 flow [2022-12-13 13:12:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 197 flow [2022-12-13 13:12:32,030 INFO L130 PetriNetUnfolder]: 6/97 cut-off events. [2022-12-13 13:12:32,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:32,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 6/97 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/81 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 13:12:32,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 2304 [2022-12-13 13:12:33,455 INFO L134 LiptonReduction]: Checked pairs total: 3085 [2022-12-13 13:12:33,455 INFO L136 LiptonReduction]: Total number of compositions: 94 [2022-12-13 13:12:33,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:12:33,475 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;@23a11af4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:12:33,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-13 13:12:33,477 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-12-13 13:12:33,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:33,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:33,478 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 13:12:33,478 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)] === [2022-12-13 13:12:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 12169, now seen corresponding path program 1 times [2022-12-13 13:12:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752295095] [2022-12-13 13:12:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:33,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:33,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752295095] [2022-12-13 13:12:33,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752295095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:33,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:33,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:12:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39975007] [2022-12-13 13:12:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:33,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:12:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:33,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:12:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:12:33,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2022-12-13 13:12:33,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:33,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2022-12-13 13:12:33,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:33,750 INFO L130 PetriNetUnfolder]: 102/206 cut-off events. [2022-12-13 13:12:33,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:33,751 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 23. Compared 731 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. [2022-12-13 13:12:33,752 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2022-12-13 13:12:33,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 107 flow [2022-12-13 13:12:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:12:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:12:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-13 13:12:33,763 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 13:12:33,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2022-12-13 13:12:33,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2022-12-13 13:12:33,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:33,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2022-12-13 13:12:33,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,774 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 300 transitions. [2022-12-13 13:12:33,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 107 flow [2022-12-13 13:12:33,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:33,777 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 66 flow [2022-12-13 13:12:33,778 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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} [2022-12-13 13:12:33,781 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-13 13:12:33,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 66 flow [2022-12-13 13:12:33,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:33,782 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 13:12:33,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:12:33,782 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)] === [2022-12-13 13:12:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash 378124, now seen corresponding path program 1 times [2022-12-13 13:12:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:33,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161509659] [2022-12-13 13:12:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:33,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161509659] [2022-12-13 13:12:33,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161509659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:33,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:33,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:12:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156445683] [2022-12-13 13:12:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:33,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:12:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:12:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:12:33,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2022-12-13 13:12:33,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:33,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2022-12-13 13:12:33,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:33,887 INFO L130 PetriNetUnfolder]: 102/205 cut-off events. [2022-12-13 13:12:33,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:33,888 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 23. Compared 727 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 410. Up to 205 conditions per place. [2022-12-13 13:12:33,888 INFO L137 encePairwiseOnDemand]: 190/192 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2022-12-13 13:12:33,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 112 flow [2022-12-13 13:12:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:12:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:12:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2022-12-13 13:12:33,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5121527777777778 [2022-12-13 13:12:33,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2022-12-13 13:12:33,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2022-12-13 13:12:33,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:33,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2022-12-13 13:12:33,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,893 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 66 flow. Second operand 3 states and 295 transitions. [2022-12-13 13:12:33,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 112 flow [2022-12-13 13:12:33,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:33,894 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 60 flow [2022-12-13 13:12:33,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-13 13:12:33,894 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-13 13:12:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 60 flow [2022-12-13 13:12:33,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:33,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:33,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:12:33,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1340494399, now seen corresponding path program 1 times [2022-12-13 13:12:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:33,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173287489] [2022-12-13 13:12:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173287489] [2022-12-13 13:12:33,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173287489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786695824] [2022-12-13 13:12:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:33,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:33,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:33,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:12:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:34,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:12:34,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:34,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:34,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786695824] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:34,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:34,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 13:12:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494211710] [2022-12-13 13:12:34,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:34,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:34,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:34,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2022-12-13 13:12:34,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 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) [2022-12-13 13:12:34,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:34,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2022-12-13 13:12:34,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:34,147 INFO L130 PetriNetUnfolder]: 102/208 cut-off events. [2022-12-13 13:12:34,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:12:34,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 208 events. 102/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 730 event pairs, 81 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 421. Up to 205 conditions per place. [2022-12-13 13:12:34,148 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2022-12-13 13:12:34,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2022-12-13 13:12:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:12:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:12:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 565 transitions. [2022-12-13 13:12:34,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4904513888888889 [2022-12-13 13:12:34,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 565 transitions. [2022-12-13 13:12:34,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 565 transitions. [2022-12-13 13:12:34,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:34,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 565 transitions. [2022-12-13 13:12:34,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,154 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 60 flow. Second operand 6 states and 565 transitions. [2022-12-13 13:12:34,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2022-12-13 13:12:34,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:34,155 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 95 flow [2022-12-13 13:12:34,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, 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=95, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 13:12:34,156 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-13 13:12:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 95 flow [2022-12-13 13:12:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 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) [2022-12-13 13:12:34,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:34,156 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:34,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:34,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:34,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -18505988, now seen corresponding path program 2 times [2022-12-13 13:12:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:34,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686141206] [2022-12-13 13:12:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686141206] [2022-12-13 13:12:34,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686141206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885570618] [2022-12-13 13:12:34,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:12:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:34,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:34,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:12:34,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:12:34,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:12:34,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 13:12:34,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:34,645 INFO L350 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 [2022-12-13 13:12:34,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:12:34,695 INFO L350 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 13 treesize of output 15 [2022-12-13 13:12:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 13:12:34,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:12:34,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885570618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:34,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:12:34,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-12-13 13:12:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177149042] [2022-12-13 13:12:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:34,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:12:34,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2022-12-13 13:12:34,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:34,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2022-12-13 13:12:34,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:34,870 INFO L130 PetriNetUnfolder]: 136/276 cut-off events. [2022-12-13 13:12:34,870 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:12:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1089 event pairs, 26 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 568. Up to 211 conditions per place. [2022-12-13 13:12:34,873 INFO L137 encePairwiseOnDemand]: 186/192 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2022-12-13 13:12:34,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 227 flow [2022-12-13 13:12:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2022-12-13 13:12:34,875 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2022-12-13 13:12:34,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2022-12-13 13:12:34,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2022-12-13 13:12:34,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:34,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2022-12-13 13:12:34,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,880 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,880 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 95 flow. Second operand 4 states and 393 transitions. [2022-12-13 13:12:34,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 227 flow [2022-12-13 13:12:34,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 213 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:34,882 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 115 flow [2022-12-13 13:12:34,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=115, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-13 13:12:34,883 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-13 13:12:34,883 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 115 flow [2022-12-13 13:12:34,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:34,884 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:34,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:12:35,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:35,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash -18490356, now seen corresponding path program 1 times [2022-12-13 13:12:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:35,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580563959] [2022-12-13 13:12:35,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:35,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580563959] [2022-12-13 13:12:35,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580563959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904303900] [2022-12-13 13:12:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:35,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:35,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:35,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:12:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:35,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:12:35,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:35,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:35,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904303900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:35,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 13:12:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367363152] [2022-12-13 13:12:35,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:35,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:12:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:12:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:12:35,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2022-12-13 13:12:35,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 90.38461538461539) internal successors, (1175), 13 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:35,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2022-12-13 13:12:35,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:35,381 INFO L130 PetriNetUnfolder]: 136/282 cut-off events. [2022-12-13 13:12:35,381 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 13:12:35,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1111 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 674. Up to 273 conditions per place. [2022-12-13 13:12:35,383 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2022-12-13 13:12:35,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 227 flow [2022-12-13 13:12:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:12:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:12:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1108 transitions. [2022-12-13 13:12:35,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4809027777777778 [2022-12-13 13:12:35,387 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1108 transitions. [2022-12-13 13:12:35,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1108 transitions. [2022-12-13 13:12:35,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:35,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1108 transitions. [2022-12-13 13:12:35,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.33333333333333) internal successors, (1108), 12 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,395 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,395 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 115 flow. Second operand 12 states and 1108 transitions. [2022-12-13 13:12:35,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 227 flow [2022-12-13 13:12:35,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:12:35,397 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 199 flow [2022-12-13 13:12:35,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=199, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-13 13:12:35,398 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2022-12-13 13:12:35,398 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 199 flow [2022-12-13 13:12:35,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.38461538461539) internal successors, (1175), 13 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:35,399 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:35,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:12:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:35,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 968426796, now seen corresponding path program 2 times [2022-12-13 13:12:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955893376] [2022-12-13 13:12:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955893376] [2022-12-13 13:12:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955893376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:35,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:12:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344894102] [2022-12-13 13:12:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:35,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:12:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:12:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:12:35,846 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2022-12-13 13:12:35,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:35,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2022-12-13 13:12:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:35,934 INFO L130 PetriNetUnfolder]: 126/262 cut-off events. [2022-12-13 13:12:35,934 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 13:12:35,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 262 events. 126/262 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 977 event pairs, 36 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 649. Up to 209 conditions per place. [2022-12-13 13:12:35,936 INFO L137 encePairwiseOnDemand]: 186/192 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-13 13:12:35,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 330 flow [2022-12-13 13:12:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:12:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:12:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2022-12-13 13:12:35,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2022-12-13 13:12:35,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2022-12-13 13:12:35,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2022-12-13 13:12:35,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:35,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2022-12-13 13:12:35,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,941 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 199 flow. Second operand 4 states and 389 transitions. [2022-12-13 13:12:35,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 330 flow [2022-12-13 13:12:35,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 282 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 13:12:35,944 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 183 flow [2022-12-13 13:12:35,945 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=183, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2022-12-13 13:12:35,945 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2022-12-13 13:12:35,945 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 183 flow [2022-12-13 13:12:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:35,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:35,946 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:35,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:12:35,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1364765797, now seen corresponding path program 1 times [2022-12-13 13:12:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:35,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760360813] [2022-12-13 13:12:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:35,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760360813] [2022-12-13 13:12:35,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760360813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:35,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:35,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:12:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401193060] [2022-12-13 13:12:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:35,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:12:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:12:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:12:36,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2022-12-13 13:12:36,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:36,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2022-12-13 13:12:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:36,086 INFO L130 PetriNetUnfolder]: 176/362 cut-off events. [2022-12-13 13:12:36,086 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 13:12:36,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 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 1486 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 940. Up to 219 conditions per place. [2022-12-13 13:12:36,088 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-13 13:12:36,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 361 flow [2022-12-13 13:12:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:12:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:12:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-12-13 13:12:36,089 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2022-12-13 13:12:36,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2022-12-13 13:12:36,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2022-12-13 13:12:36,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:36,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2022-12-13 13:12:36,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,090 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 183 flow. Second operand 3 states and 310 transitions. [2022-12-13 13:12:36,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 361 flow [2022-12-13 13:12:36,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:36,092 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 194 flow [2022-12-13 13:12:36,092 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=194, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2022-12-13 13:12:36,093 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2022-12-13 13:12:36,093 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 194 flow [2022-12-13 13:12:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:36,093 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:36,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:12:36,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1349803495, now seen corresponding path program 1 times [2022-12-13 13:12:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:36,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212089513] [2022-12-13 13:12:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:36,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212089513] [2022-12-13 13:12:36,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212089513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:36,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:36,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:12:36,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361818648] [2022-12-13 13:12:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:12:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:36,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:12:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:12:36,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2022-12-13 13:12:36,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:36,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2022-12-13 13:12:36,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:36,238 INFO L130 PetriNetUnfolder]: 238/486 cut-off events. [2022-12-13 13:12:36,239 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-13 13:12:36,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 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 2045 event pairs, 118 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1352. Up to 333 conditions per place. [2022-12-13 13:12:36,241 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-12-13 13:12:36,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 391 flow [2022-12-13 13:12:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:12:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:12:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2022-12-13 13:12:36,242 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5434027777777778 [2022-12-13 13:12:36,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2022-12-13 13:12:36,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2022-12-13 13:12:36,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:36,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2022-12-13 13:12:36,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,243 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 194 flow. Second operand 3 states and 313 transitions. [2022-12-13 13:12:36,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 391 flow [2022-12-13 13:12:36,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:36,245 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 208 flow [2022-12-13 13:12:36,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=208, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2022-12-13 13:12:36,246 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 33 predicate places. [2022-12-13 13:12:36,246 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 208 flow [2022-12-13 13:12:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:36,246 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:36,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:12:36,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1563468094, now seen corresponding path program 1 times [2022-12-13 13:12:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:36,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631088191] [2022-12-13 13:12:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:36,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631088191] [2022-12-13 13:12:36,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631088191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:36,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:36,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706260390] [2022-12-13 13:12:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:36,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:36,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:36,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:36,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:36,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:36,802 INFO L130 PetriNetUnfolder]: 263/549 cut-off events. [2022-12-13 13:12:36,802 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-12-13 13:12:36,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 549 events. 263/549 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2469 event pairs, 109 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 1632. Up to 430 conditions per place. [2022-12-13 13:12:36,807 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 57 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2022-12-13 13:12:36,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 476 flow [2022-12-13 13:12:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:12:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:12:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2022-12-13 13:12:36,809 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4615885416666667 [2022-12-13 13:12:36,809 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 709 transitions. [2022-12-13 13:12:36,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 709 transitions. [2022-12-13 13:12:36,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:36,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 709 transitions. [2022-12-13 13:12:36,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,814 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 208 flow. Second operand 8 states and 709 transitions. [2022-12-13 13:12:36,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 476 flow [2022-12-13 13:12:36,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:12:36,817 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 329 flow [2022-12-13 13:12:36,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2022-12-13 13:12:36,818 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 44 predicate places. [2022-12-13 13:12:36,818 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 329 flow [2022-12-13 13:12:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:36,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:36,819 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:12:36,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1089412905, now seen corresponding path program 1 times [2022-12-13 13:12:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101099997] [2022-12-13 13:12:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101099997] [2022-12-13 13:12:37,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101099997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:37,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:37,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:12:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973020330] [2022-12-13 13:12:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:37,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:37,105 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2022-12-13 13:12:37,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 329 flow. Second operand has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:37,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2022-12-13 13:12:37,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:37,352 INFO L130 PetriNetUnfolder]: 292/604 cut-off events. [2022-12-13 13:12:37,352 INFO L131 PetriNetUnfolder]: For 936/936 co-relation queries the response was YES. [2022-12-13 13:12:37,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 604 events. 292/604 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2742 event pairs, 116 based on Foata normal form. 19/519 useless extension candidates. Maximal degree in co-relation 2073. Up to 435 conditions per place. [2022-12-13 13:12:37,355 INFO L137 encePairwiseOnDemand]: 185/192 looper letters, 64 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2022-12-13 13:12:37,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 628 flow [2022-12-13 13:12:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 830 transitions. [2022-12-13 13:12:37,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48032407407407407 [2022-12-13 13:12:37,357 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 830 transitions. [2022-12-13 13:12:37,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 830 transitions. [2022-12-13 13:12:37,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:37,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 830 transitions. [2022-12-13 13:12:37,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.22222222222223) internal successors, (830), 9 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,360 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,360 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 329 flow. Second operand 9 states and 830 transitions. [2022-12-13 13:12:37,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 628 flow [2022-12-13 13:12:37,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 596 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:37,363 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 393 flow [2022-12-13 13:12:37,364 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2022-12-13 13:12:37,364 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 52 predicate places. [2022-12-13 13:12:37,364 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 393 flow [2022-12-13 13:12:37,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,365 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:37,365 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:37,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:12:37,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1089412882, now seen corresponding path program 2 times [2022-12-13 13:12:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:37,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227835469] [2022-12-13 13:12:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:37,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:37,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227835469] [2022-12-13 13:12:37,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227835469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:37,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:37,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645721841] [2022-12-13 13:12:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:37,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:37,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:37,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:37,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:37,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:37,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:37,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:37,983 INFO L130 PetriNetUnfolder]: 301/622 cut-off events. [2022-12-13 13:12:37,983 INFO L131 PetriNetUnfolder]: For 1572/1572 co-relation queries the response was YES. [2022-12-13 13:12:37,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 622 events. 301/622 cut-off events. For 1572/1572 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2881 event pairs, 125 based on Foata normal form. 8/524 useless extension candidates. Maximal degree in co-relation 2339. Up to 484 conditions per place. [2022-12-13 13:12:37,986 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 59 selfloop transitions, 28 changer transitions 0/87 dead transitions. [2022-12-13 13:12:37,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 728 flow [2022-12-13 13:12:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 955 transitions. [2022-12-13 13:12:37,988 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4521780303030303 [2022-12-13 13:12:37,988 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 955 transitions. [2022-12-13 13:12:37,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 955 transitions. [2022-12-13 13:12:37,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:37,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 955 transitions. [2022-12-13 13:12:37,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.81818181818181) internal successors, (955), 11 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,992 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,992 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 393 flow. Second operand 11 states and 955 transitions. [2022-12-13 13:12:37,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 728 flow [2022-12-13 13:12:37,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 87 transitions, 672 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:37,997 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 514 flow [2022-12-13 13:12:37,997 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2022-12-13 13:12:37,998 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 60 predicate places. [2022-12-13 13:12:37,998 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 514 flow [2022-12-13 13:12:37,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:37,998 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:37,998 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:37,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:12:37,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1089432435, now seen corresponding path program 2 times [2022-12-13 13:12:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:37,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134235361] [2022-12-13 13:12:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:38,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134235361] [2022-12-13 13:12:38,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134235361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:38,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:38,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:12:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812595024] [2022-12-13 13:12:38,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:38,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:12:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:12:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:12:38,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2022-12-13 13:12:38,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 514 flow. Second operand has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:38,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2022-12-13 13:12:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:38,545 INFO L130 PetriNetUnfolder]: 357/725 cut-off events. [2022-12-13 13:12:38,545 INFO L131 PetriNetUnfolder]: For 2911/2911 co-relation queries the response was YES. [2022-12-13 13:12:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3011 conditions, 725 events. 357/725 cut-off events. For 2911/2911 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3480 event pairs, 97 based on Foata normal form. 16/624 useless extension candidates. Maximal degree in co-relation 2972. Up to 447 conditions per place. [2022-12-13 13:12:38,549 INFO L137 encePairwiseOnDemand]: 185/192 looper letters, 76 selfloop transitions, 30 changer transitions 0/106 dead transitions. [2022-12-13 13:12:38,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 948 flow [2022-12-13 13:12:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2022-12-13 13:12:38,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4855324074074074 [2022-12-13 13:12:38,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 839 transitions. [2022-12-13 13:12:38,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 839 transitions. [2022-12-13 13:12:38,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:38,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 839 transitions. [2022-12-13 13:12:38,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,554 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,554 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 514 flow. Second operand 9 states and 839 transitions. [2022-12-13 13:12:38,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 948 flow [2022-12-13 13:12:38,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 106 transitions, 930 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:38,560 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 667 flow [2022-12-13 13:12:38,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=667, PETRI_PLACES=96, PETRI_TRANSITIONS=73} [2022-12-13 13:12:38,561 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2022-12-13 13:12:38,561 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 667 flow [2022-12-13 13:12:38,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:38,561 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:38,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:12:38,561 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)] === [2022-12-13 13:12:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1089432412, now seen corresponding path program 3 times [2022-12-13 13:12:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:38,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415208433] [2022-12-13 13:12:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415208433] [2022-12-13 13:12:38,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415208433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:38,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:38,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122655356] [2022-12-13 13:12:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:38,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:38,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:38,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 73 transitions, 667 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:38,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:38,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:38,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:39,172 INFO L130 PetriNetUnfolder]: 350/711 cut-off events. [2022-12-13 13:12:39,172 INFO L131 PetriNetUnfolder]: For 4144/4144 co-relation queries the response was YES. [2022-12-13 13:12:39,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 711 events. 350/711 cut-off events. For 4144/4144 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3374 event pairs, 97 based on Foata normal form. 7/602 useless extension candidates. Maximal degree in co-relation 3234. Up to 528 conditions per place. [2022-12-13 13:12:39,177 INFO L137 encePairwiseOnDemand]: 184/192 looper letters, 73 selfloop transitions, 32 changer transitions 0/105 dead transitions. [2022-12-13 13:12:39,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 1027 flow [2022-12-13 13:12:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 964 transitions. [2022-12-13 13:12:39,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4564393939393939 [2022-12-13 13:12:39,179 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 964 transitions. [2022-12-13 13:12:39,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 964 transitions. [2022-12-13 13:12:39,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:39,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 964 transitions. [2022-12-13 13:12:39,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,183 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,183 INFO L175 Difference]: Start difference. First operand has 96 places, 73 transitions, 667 flow. Second operand 11 states and 964 transitions. [2022-12-13 13:12:39,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 1027 flow [2022-12-13 13:12:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 980 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 13:12:39,191 INFO L231 Difference]: Finished difference. Result has 103 places, 73 transitions, 705 flow [2022-12-13 13:12:39,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=705, PETRI_PLACES=103, PETRI_TRANSITIONS=73} [2022-12-13 13:12:39,192 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 76 predicate places. [2022-12-13 13:12:39,192 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 73 transitions, 705 flow [2022-12-13 13:12:39,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:39,192 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:12:39,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1087054138, now seen corresponding path program 1 times [2022-12-13 13:12:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:39,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884829665] [2022-12-13 13:12:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:39,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884829665] [2022-12-13 13:12:39,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884829665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:39,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:39,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096722268] [2022-12-13 13:12:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:39,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:39,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:39,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:39,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 73 transitions, 705 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:39,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:39,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:39,732 INFO L130 PetriNetUnfolder]: 371/766 cut-off events. [2022-12-13 13:12:39,732 INFO L131 PetriNetUnfolder]: For 4519/4519 co-relation queries the response was YES. [2022-12-13 13:12:39,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 766 events. 371/766 cut-off events. For 4519/4519 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3846 event pairs, 133 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 3513. Up to 622 conditions per place. [2022-12-13 13:12:39,737 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 80 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2022-12-13 13:12:39,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 1233 flow [2022-12-13 13:12:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:12:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:12:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2022-12-13 13:12:39,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4615885416666667 [2022-12-13 13:12:39,740 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 709 transitions. [2022-12-13 13:12:39,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 709 transitions. [2022-12-13 13:12:39,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:39,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 709 transitions. [2022-12-13 13:12:39,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,743 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,743 INFO L175 Difference]: Start difference. First operand has 103 places, 73 transitions, 705 flow. Second operand 8 states and 709 transitions. [2022-12-13 13:12:39,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 1233 flow [2022-12-13 13:12:39,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 1154 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-12-13 13:12:39,752 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 917 flow [2022-12-13 13:12:39,752 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=917, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2022-12-13 13:12:39,752 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2022-12-13 13:12:39,753 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 917 flow [2022-12-13 13:12:39,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:39,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:39,753 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:39,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:12:39,753 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1087054139, now seen corresponding path program 1 times [2022-12-13 13:12:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:39,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386418948] [2022-12-13 13:12:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:39,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386418948] [2022-12-13 13:12:39,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386418948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:39,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:39,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385216946] [2022-12-13 13:12:39,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:39,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:39,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:40,065 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2022-12-13 13:12:40,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 917 flow. Second operand has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:40,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2022-12-13 13:12:40,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:40,342 INFO L130 PetriNetUnfolder]: 424/897 cut-off events. [2022-12-13 13:12:40,343 INFO L131 PetriNetUnfolder]: For 5669/5669 co-relation queries the response was YES. [2022-12-13 13:12:40,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 897 events. 424/897 cut-off events. For 5669/5669 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4856 event pairs, 84 based on Foata normal form. 7/788 useless extension candidates. Maximal degree in co-relation 4417. Up to 474 conditions per place. [2022-12-13 13:12:40,348 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 83 selfloop transitions, 41 changer transitions 0/124 dead transitions. [2022-12-13 13:12:40,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 124 transitions, 1469 flow [2022-12-13 13:12:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:12:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:12:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 789 transitions. [2022-12-13 13:12:40,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4565972222222222 [2022-12-13 13:12:40,351 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 789 transitions. [2022-12-13 13:12:40,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 789 transitions. [2022-12-13 13:12:40,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:40,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 789 transitions. [2022-12-13 13:12:40,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,355 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 917 flow. Second operand 9 states and 789 transitions. [2022-12-13 13:12:40,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 124 transitions, 1469 flow [2022-12-13 13:12:40,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 124 transitions, 1397 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 13:12:40,367 INFO L231 Difference]: Finished difference. Result has 110 places, 96 transitions, 1101 flow [2022-12-13 13:12:40,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=110, PETRI_TRANSITIONS=96} [2022-12-13 13:12:40,367 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 83 predicate places. [2022-12-13 13:12:40,367 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 96 transitions, 1101 flow [2022-12-13 13:12:40,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:40,368 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:40,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:12:40,368 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1095155369, now seen corresponding path program 2 times [2022-12-13 13:12:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697625282] [2022-12-13 13:12:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697625282] [2022-12-13 13:12:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697625282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:40,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403038817] [2022-12-13 13:12:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:40,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2022-12-13 13:12:40,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 96 transitions, 1101 flow. Second operand has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:40,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2022-12-13 13:12:40,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:40,899 INFO L130 PetriNetUnfolder]: 450/942 cut-off events. [2022-12-13 13:12:40,899 INFO L131 PetriNetUnfolder]: For 7009/7009 co-relation queries the response was YES. [2022-12-13 13:12:40,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4990 conditions, 942 events. 450/942 cut-off events. For 7009/7009 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5098 event pairs, 97 based on Foata normal form. 8/834 useless extension candidates. Maximal degree in co-relation 4939. Up to 474 conditions per place. [2022-12-13 13:12:40,904 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 90 selfloop transitions, 48 changer transitions 0/138 dead transitions. [2022-12-13 13:12:40,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 1739 flow [2022-12-13 13:12:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 951 transitions. [2022-12-13 13:12:40,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4502840909090909 [2022-12-13 13:12:40,907 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 951 transitions. [2022-12-13 13:12:40,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 951 transitions. [2022-12-13 13:12:40,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:40,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 951 transitions. [2022-12-13 13:12:40,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.45454545454545) internal successors, (951), 11 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,913 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,913 INFO L175 Difference]: Start difference. First operand has 110 places, 96 transitions, 1101 flow. Second operand 11 states and 951 transitions. [2022-12-13 13:12:40,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 1739 flow [2022-12-13 13:12:40,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 138 transitions, 1691 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 13:12:40,935 INFO L231 Difference]: Finished difference. Result has 120 places, 109 transitions, 1401 flow [2022-12-13 13:12:40,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1401, PETRI_PLACES=120, PETRI_TRANSITIONS=109} [2022-12-13 13:12:40,936 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 93 predicate places. [2022-12-13 13:12:40,936 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 1401 flow [2022-12-13 13:12:40,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:40,936 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:40,936 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:40,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:12:40,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1094203978, now seen corresponding path program 2 times [2022-12-13 13:12:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:40,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110524666] [2022-12-13 13:12:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110524666] [2022-12-13 13:12:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110524666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:41,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:41,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935187529] [2022-12-13 13:12:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:41,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:41,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:41,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 109 transitions, 1401 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:41,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:41,685 INFO L130 PetriNetUnfolder]: 461/965 cut-off events. [2022-12-13 13:12:41,685 INFO L131 PetriNetUnfolder]: For 9621/9621 co-relation queries the response was YES. [2022-12-13 13:12:41,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 965 events. 461/965 cut-off events. For 9621/9621 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5224 event pairs, 175 based on Foata normal form. 7/856 useless extension candidates. Maximal degree in co-relation 5695. Up to 829 conditions per place. [2022-12-13 13:12:41,695 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 98 selfloop transitions, 36 changer transitions 0/134 dead transitions. [2022-12-13 13:12:41,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 134 transitions, 1895 flow [2022-12-13 13:12:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:12:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:12:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 874 transitions. [2022-12-13 13:12:41,697 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4552083333333333 [2022-12-13 13:12:41,698 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 874 transitions. [2022-12-13 13:12:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 874 transitions. [2022-12-13 13:12:41,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:41,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 874 transitions. [2022-12-13 13:12:41,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,703 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,703 INFO L175 Difference]: Start difference. First operand has 120 places, 109 transitions, 1401 flow. Second operand 10 states and 874 transitions. [2022-12-13 13:12:41,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 134 transitions, 1895 flow [2022-12-13 13:12:41,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 134 transitions, 1872 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 13:12:41,735 INFO L231 Difference]: Finished difference. Result has 128 places, 114 transitions, 1551 flow [2022-12-13 13:12:41,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1551, PETRI_PLACES=128, PETRI_TRANSITIONS=114} [2022-12-13 13:12:41,735 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 101 predicate places. [2022-12-13 13:12:41,735 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 114 transitions, 1551 flow [2022-12-13 13:12:41,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,736 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:41,736 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:41,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:12:41,736 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)] === [2022-12-13 13:12:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1095197218, now seen corresponding path program 3 times [2022-12-13 13:12:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154510089] [2022-12-13 13:12:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:41,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154510089] [2022-12-13 13:12:41,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154510089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:41,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:41,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222535712] [2022-12-13 13:12:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:41,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:41,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2022-12-13 13:12:41,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 114 transitions, 1551 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:41,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:41,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2022-12-13 13:12:41,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:42,356 INFO L130 PetriNetUnfolder]: 483/1015 cut-off events. [2022-12-13 13:12:42,357 INFO L131 PetriNetUnfolder]: For 11127/11127 co-relation queries the response was YES. [2022-12-13 13:12:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 1015 events. 483/1015 cut-off events. For 11127/11127 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5642 event pairs, 146 based on Foata normal form. 14/913 useless extension candidates. Maximal degree in co-relation 6129. Up to 778 conditions per place. [2022-12-13 13:12:42,365 INFO L137 encePairwiseOnDemand]: 184/192 looper letters, 102 selfloop transitions, 52 changer transitions 0/154 dead transitions. [2022-12-13 13:12:42,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 154 transitions, 2238 flow [2022-12-13 13:12:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 965 transitions. [2022-12-13 13:12:42,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4569128787878788 [2022-12-13 13:12:42,367 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 965 transitions. [2022-12-13 13:12:42,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 965 transitions. [2022-12-13 13:12:42,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:42,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 965 transitions. [2022-12-13 13:12:42,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.72727272727273) internal successors, (965), 11 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:42,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:42,372 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:42,372 INFO L175 Difference]: Start difference. First operand has 128 places, 114 transitions, 1551 flow. Second operand 11 states and 965 transitions. [2022-12-13 13:12:42,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 154 transitions, 2238 flow [2022-12-13 13:12:42,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 154 transitions, 2169 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:42,395 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 1752 flow [2022-12-13 13:12:42,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1752, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2022-12-13 13:12:42,395 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 108 predicate places. [2022-12-13 13:12:42,395 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 1752 flow [2022-12-13 13:12:42,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:42,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:42,396 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:42,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:12:42,396 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1095197219, now seen corresponding path program 3 times [2022-12-13 13:12:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:42,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108207821] [2022-12-13 13:12:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108207821] [2022-12-13 13:12:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108207821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:12:42,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:12:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:12:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156665965] [2022-12-13 13:12:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:12:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:12:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:12:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:12:42,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2022-12-13 13:12:42,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 1752 flow. Second operand has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:42,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:42,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2022-12-13 13:12:42,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:43,015 INFO L130 PetriNetUnfolder]: 468/985 cut-off events. [2022-12-13 13:12:43,015 INFO L131 PetriNetUnfolder]: For 11969/11969 co-relation queries the response was YES. [2022-12-13 13:12:43,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 985 events. 468/985 cut-off events. For 11969/11969 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5297 event pairs, 58 based on Foata normal form. 15/884 useless extension candidates. Maximal degree in co-relation 6093. Up to 427 conditions per place. [2022-12-13 13:12:43,021 INFO L137 encePairwiseOnDemand]: 184/192 looper letters, 94 selfloop transitions, 64 changer transitions 0/158 dead transitions. [2022-12-13 13:12:43,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 2310 flow [2022-12-13 13:12:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:12:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:12:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 963 transitions. [2022-12-13 13:12:43,023 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4559659090909091 [2022-12-13 13:12:43,023 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 963 transitions. [2022-12-13 13:12:43,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 963 transitions. [2022-12-13 13:12:43,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:12:43,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 963 transitions. [2022-12-13 13:12:43,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:43,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:43,028 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:43,028 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 1752 flow. Second operand 11 states and 963 transitions. [2022-12-13 13:12:43,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 2310 flow [2022-12-13 13:12:43,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 158 transitions, 2243 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:43,058 INFO L231 Difference]: Finished difference. Result has 142 places, 117 transitions, 1831 flow [2022-12-13 13:12:43,059 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1831, PETRI_PLACES=142, PETRI_TRANSITIONS=117} [2022-12-13 13:12:43,059 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 115 predicate places. [2022-12-13 13:12:43,059 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 117 transitions, 1831 flow [2022-12-13 13:12:43,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.375) internal successors, (651), 8 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:43,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:12:43,060 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:43,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:12:43,060 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:12:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash -81006829, now seen corresponding path program 1 times [2022-12-13 13:12:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:12:43,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695473604] [2022-12-13 13:12:43,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:12:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:12:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695473604] [2022-12-13 13:12:43,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695473604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:12:43,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678126818] [2022-12-13 13:12:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:43,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:12:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:12:43,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:12:43,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:12:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:43,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 13:12:43,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:43,370 INFO L350 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 [2022-12-13 13:12:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:12:43,431 INFO L350 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 13 treesize of output 15 [2022-12-13 13:12:43,484 INFO L350 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 18 treesize of output 13 [2022-12-13 13:12:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:48,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:53,021 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_586 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_586) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_588) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)))) is different from false [2022-12-13 13:12:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:12:53,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678126818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:53,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:12:53,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 13:12:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103110277] [2022-12-13 13:12:53,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:53,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:12:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:12:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:12:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2022-12-13 13:12:53,165 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 192 [2022-12-13 13:12:53,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 117 transitions, 1831 flow. Second operand has 19 states, 19 states have (on average 73.63157894736842) internal successors, (1399), 19 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:53,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:12:53,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 192 [2022-12-13 13:12:53,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:12:54,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:55,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:57,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:58,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:59,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:01,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:02,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:04,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:08,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:09,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:10,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:12,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:13,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:14,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:16,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:17,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:19,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:20,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:23,510 INFO L130 PetriNetUnfolder]: 448/945 cut-off events. [2022-12-13 13:13:23,510 INFO L131 PetriNetUnfolder]: For 13877/13877 co-relation queries the response was YES. [2022-12-13 13:13:23,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6157 conditions, 945 events. 448/945 cut-off events. For 13877/13877 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5019 event pairs, 97 based on Foata normal form. 19/848 useless extension candidates. Maximal degree in co-relation 6091. Up to 628 conditions per place. [2022-12-13 13:13:23,516 INFO L137 encePairwiseOnDemand]: 185/192 looper letters, 116 selfloop transitions, 57 changer transitions 0/173 dead transitions. [2022-12-13 13:13:23,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 173 transitions, 2771 flow [2022-12-13 13:13:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:13:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:13:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 881 transitions. [2022-12-13 13:13:23,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4171401515151515 [2022-12-13 13:13:23,518 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 881 transitions. [2022-12-13 13:13:23,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 881 transitions. [2022-12-13 13:13:23,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:13:23,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 881 transitions. [2022-12-13 13:13:23,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.0909090909091) internal successors, (881), 11 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:23,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:23,520 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:23,520 INFO L175 Difference]: Start difference. First operand has 142 places, 117 transitions, 1831 flow. Second operand 11 states and 881 transitions. [2022-12-13 13:13:23,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 173 transitions, 2771 flow [2022-12-13 13:13:23,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 173 transitions, 2597 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-12-13 13:13:23,547 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 2081 flow [2022-12-13 13:13:23,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2081, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2022-12-13 13:13:23,548 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 120 predicate places. [2022-12-13 13:13:23,548 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 2081 flow [2022-12-13 13:13:23,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 73.63157894736842) internal successors, (1399), 19 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:23,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:23,548 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:23,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:13:23,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:23,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:13:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1574886045, now seen corresponding path program 1 times [2022-12-13 13:13:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:23,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398588232] [2022-12-13 13:13:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:13:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398588232] [2022-12-13 13:13:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398588232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125106632] [2022-12-13 13:13:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:13:23,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:23,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:13:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:24,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 13:13:24,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:24,015 INFO L350 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 [2022-12-13 13:13:24,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:13:24,068 INFO L350 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 13 treesize of output 15 [2022-12-13 13:13:24,111 INFO L350 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 18 treesize of output 13 [2022-12-13 13:13:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:13:29,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:13:33,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int) (v_ArrVal_657 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_656) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| v_ArrVal_657) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)))) is different from false [2022-12-13 13:13:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:13:33,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125106632] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:13:33,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:13:33,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 13:13:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145368056] [2022-12-13 13:13:33,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:13:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:13:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:13:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:13:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2022-12-13 13:13:33,904 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 192 [2022-12-13 13:13:33,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 2081 flow. Second operand has 19 states, 19 states have (on average 72.63157894736842) internal successors, (1380), 19 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:13:33,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:13:33,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 192 [2022-12-13 13:13:33,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:13:35,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:36,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:38,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:39,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:40,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:42,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:43,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:45,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:50,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:56,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:58,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:00,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:04,129 INFO L130 PetriNetUnfolder]: 424/895 cut-off events. [2022-12-13 13:14:04,129 INFO L131 PetriNetUnfolder]: For 13589/13589 co-relation queries the response was YES. [2022-12-13 13:14:04,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 895 events. 424/895 cut-off events. For 13589/13589 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4690 event pairs, 121 based on Foata normal form. 28/839 useless extension candidates. Maximal degree in co-relation 5818. Up to 607 conditions per place. [2022-12-13 13:14:04,134 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 130 selfloop transitions, 59 changer transitions 0/189 dead transitions. [2022-12-13 13:14:04,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 189 transitions, 3137 flow [2022-12-13 13:14:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:14:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:14:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 947 transitions. [2022-12-13 13:14:04,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4110243055555556 [2022-12-13 13:14:04,136 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 947 transitions. [2022-12-13 13:14:04,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 947 transitions. [2022-12-13 13:14:04,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:14:04,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 947 transitions. [2022-12-13 13:14:04,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 78.91666666666667) internal successors, (947), 12 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,138 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,139 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 2081 flow. Second operand 12 states and 947 transitions. [2022-12-13 13:14:04,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 189 transitions, 3137 flow [2022-12-13 13:14:04,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 189 transitions, 2923 flow, removed 49 selfloop flow, removed 4 redundant places. [2022-12-13 13:14:04,172 INFO L231 Difference]: Finished difference. Result has 160 places, 145 transitions, 2380 flow [2022-12-13 13:14:04,172 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2380, PETRI_PLACES=160, PETRI_TRANSITIONS=145} [2022-12-13 13:14:04,172 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 133 predicate places. [2022-12-13 13:14:04,172 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 145 transitions, 2380 flow [2022-12-13 13:14:04,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 72.63157894736842) internal successors, (1380), 19 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:04,173 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:04,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:14:04,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:04,374 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)] === [2022-12-13 13:14:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -538202559, now seen corresponding path program 1 times [2022-12-13 13:14:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:04,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708577210] [2022-12-13 13:14:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 13:14:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708577210] [2022-12-13 13:14:04,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708577210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:04,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:04,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:14:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309480038] [2022-12-13 13:14:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:04,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:04,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2022-12-13 13:14:04,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 145 transitions, 2380 flow. Second operand has 3 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) [2022-12-13 13:14:04,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:04,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2022-12-13 13:14:04,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:04,600 INFO L130 PetriNetUnfolder]: 392/831 cut-off events. [2022-12-13 13:14:04,600 INFO L131 PetriNetUnfolder]: For 12461/12461 co-relation queries the response was YES. [2022-12-13 13:14:04,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 831 events. 392/831 cut-off events. For 12461/12461 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4273 event pairs, 115 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 5685. Up to 617 conditions per place. [2022-12-13 13:14:04,605 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 157 selfloop transitions, 13 changer transitions 0/170 dead transitions. [2022-12-13 13:14:04,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 170 transitions, 3030 flow [2022-12-13 13:14:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:14:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2022-12-13 13:14:04,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2022-12-13 13:14:04,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2022-12-13 13:14:04,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2022-12-13 13:14:04,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:14:04,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2022-12-13 13:14:04,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,608 INFO L175 Difference]: Start difference. First operand has 160 places, 145 transitions, 2380 flow. Second operand 3 states and 302 transitions. [2022-12-13 13:14:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 170 transitions, 3030 flow [2022-12-13 13:14:04,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 170 transitions, 2928 flow, removed 45 selfloop flow, removed 2 redundant places. [2022-12-13 13:14:04,642 INFO L231 Difference]: Finished difference. Result has 160 places, 145 transitions, 2351 flow [2022-12-13 13:14:04,642 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2351, PETRI_PLACES=160, PETRI_TRANSITIONS=145} [2022-12-13 13:14:04,643 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 133 predicate places. [2022-12-13 13:14:04,643 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 145 transitions, 2351 flow [2022-12-13 13:14:04,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-12-13 13:14:04,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:04,643 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:04,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:14:04,643 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:14:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash -538202560, now seen corresponding path program 1 times [2022-12-13 13:14:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993974072] [2022-12-13 13:14:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:04,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993974072] [2022-12-13 13:14:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993974072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:14:04,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847289350] [2022-12-13 13:14:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:04,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:14:04,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:14:04,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:14:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:04,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:14:04,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:14:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:04,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:14:04,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847289350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:04,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:14:04,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:14:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857023967] [2022-12-13 13:14:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:04,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:14:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:14:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:14:04,787 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2022-12-13 13:14:04,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 145 transitions, 2351 flow. Second operand has 4 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) [2022-12-13 13:14:04,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:04,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2022-12-13 13:14:04,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:04,976 INFO L130 PetriNetUnfolder]: 360/767 cut-off events. [2022-12-13 13:14:04,976 INFO L131 PetriNetUnfolder]: For 11554/11554 co-relation queries the response was YES. [2022-12-13 13:14:04,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 767 events. 360/767 cut-off events. For 11554/11554 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3834 event pairs, 87 based on Foata normal form. 32/777 useless extension candidates. Maximal degree in co-relation 5372. Up to 459 conditions per place. [2022-12-13 13:14:04,987 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 169 selfloop transitions, 6 changer transitions 0/175 dead transitions. [2022-12-13 13:14:04,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 3012 flow [2022-12-13 13:14:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:14:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:14:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-12-13 13:14:04,988 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 13:14:04,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2022-12-13 13:14:04,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2022-12-13 13:14:04,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:14:04,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2022-12-13 13:14:04,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:04,990 INFO L175 Difference]: Start difference. First operand has 160 places, 145 transitions, 2351 flow. Second operand 4 states and 408 transitions. [2022-12-13 13:14:04,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 3012 flow [2022-12-13 13:14:05,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 175 transitions, 2997 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:14:05,018 INFO L231 Difference]: Finished difference. Result has 161 places, 144 transitions, 2344 flow [2022-12-13 13:14:05,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2344, PETRI_PLACES=161, PETRI_TRANSITIONS=144} [2022-12-13 13:14:05,019 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 134 predicate places. [2022-12-13 13:14:05,019 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 144 transitions, 2344 flow [2022-12-13 13:14:05,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2022-12-13 13:14:05,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:05,019 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:05,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:14:05,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:14:05,221 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:14:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1637014325, now seen corresponding path program 1 times [2022-12-13 13:14:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:05,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182704029] [2022-12-13 13:14:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182704029] [2022-12-13 13:14:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182704029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:05,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:05,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:14:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468385043] [2022-12-13 13:14:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:05,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:05,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2022-12-13 13:14:05,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 144 transitions, 2344 flow. Second operand has 3 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) [2022-12-13 13:14:05,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:05,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2022-12-13 13:14:05,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:05,492 INFO L130 PetriNetUnfolder]: 342/727 cut-off events. [2022-12-13 13:14:05,493 INFO L131 PetriNetUnfolder]: For 10864/10864 co-relation queries the response was YES. [2022-12-13 13:14:05,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 727 events. 342/727 cut-off events. For 10864/10864 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3540 event pairs, 103 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 5155. Up to 698 conditions per place. [2022-12-13 13:14:05,497 INFO L137 encePairwiseOnDemand]: 190/192 looper letters, 155 selfloop transitions, 1 changer transitions 0/156 dead transitions. [2022-12-13 13:14:05,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 156 transitions, 2822 flow [2022-12-13 13:14:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:14:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2022-12-13 13:14:05,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-13 13:14:05,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2022-12-13 13:14:05,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2022-12-13 13:14:05,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:14:05,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2022-12-13 13:14:05,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,499 INFO L175 Difference]: Start difference. First operand has 161 places, 144 transitions, 2344 flow. Second operand 3 states and 296 transitions. [2022-12-13 13:14:05,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 156 transitions, 2822 flow [2022-12-13 13:14:05,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 2811 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:14:05,529 INFO L231 Difference]: Finished difference. Result has 160 places, 143 transitions, 2334 flow [2022-12-13 13:14:05,529 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2334, PETRI_PLACES=160, PETRI_TRANSITIONS=143} [2022-12-13 13:14:05,529 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 133 predicate places. [2022-12-13 13:14:05,529 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 143 transitions, 2334 flow [2022-12-13 13:14:05,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-12-13 13:14:05,530 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:05,530 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:14:05,530 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:14:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1637014324, now seen corresponding path program 1 times [2022-12-13 13:14:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:05,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723259660] [2022-12-13 13:14:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 13:14:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:05,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723259660] [2022-12-13 13:14:05,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723259660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:14:05,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:14:05,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:14:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324151347] [2022-12-13 13:14:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:14:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:14:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:14:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:14:05,571 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 192 [2022-12-13 13:14:05,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 143 transitions, 2334 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:05,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 192 [2022-12-13 13:14:05,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:05,720 INFO L130 PetriNetUnfolder]: 324/687 cut-off events. [2022-12-13 13:14:05,720 INFO L131 PetriNetUnfolder]: For 10273/10273 co-relation queries the response was YES. [2022-12-13 13:14:05,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 687 events. 324/687 cut-off events. For 10273/10273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3290 event pairs, 80 based on Foata normal form. 22/709 useless extension candidates. Maximal degree in co-relation 4958. Up to 525 conditions per place. [2022-12-13 13:14:05,725 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 153 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2022-12-13 13:14:05,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 165 transitions, 2963 flow [2022-12-13 13:14:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:14:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:14:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-12-13 13:14:05,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-13 13:14:05,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2022-12-13 13:14:05,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2022-12-13 13:14:05,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:14:05,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2022-12-13 13:14:05,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,727 INFO L175 Difference]: Start difference. First operand has 160 places, 143 transitions, 2334 flow. Second operand 3 states and 294 transitions. [2022-12-13 13:14:05,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 165 transitions, 2963 flow [2022-12-13 13:14:05,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 165 transitions, 2960 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:14:05,756 INFO L231 Difference]: Finished difference. Result has 161 places, 143 transitions, 2371 flow [2022-12-13 13:14:05,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2371, PETRI_PLACES=161, PETRI_TRANSITIONS=143} [2022-12-13 13:14:05,757 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 134 predicate places. [2022-12-13 13:14:05,757 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 143 transitions, 2371 flow [2022-12-13 13:14:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:05,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:05,757 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:14:05,758 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:14:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1769841879, now seen corresponding path program 1 times [2022-12-13 13:14:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988648928] [2022-12-13 13:14:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:06,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:06,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988648928] [2022-12-13 13:14:06,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988648928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:14:06,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062546848] [2022-12-13 13:14:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:06,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:14:06,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:14:06,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:14:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:06,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 13:14:06,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:14:06,312 INFO L350 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 [2022-12-13 13:14:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:14:06,382 INFO L350 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 13 treesize of output 15 [2022-12-13 13:14:06,484 INFO L350 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 [2022-12-13 13:14:06,691 INFO L350 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 21 treesize of output 16 [2022-12-13 13:14:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:06,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:14:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:14:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062546848] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:14:17,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:14:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 13:14:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449723833] [2022-12-13 13:14:17,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:14:17,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 13:14:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 13:14:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=955, Unknown=7, NotChecked=0, Total=1122 [2022-12-13 13:14:19,953 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] [2022-12-13 13:14:21,994 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] [2022-12-13 13:14:24,531 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] [2022-12-13 13:14:26,996 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] [2022-12-13 13:14:29,030 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] [2022-12-13 13:14:31,044 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] [2022-12-13 13:14:33,066 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] [2022-12-13 13:14:35,177 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] [2022-12-13 13:14:37,192 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] [2022-12-13 13:14:39,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:14:41,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:14:43,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] [2022-12-13 13:14:45,555 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] [2022-12-13 13:14:47,728 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] [2022-12-13 13:14:49,753 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] [2022-12-13 13:14:51,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:14:53,484 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] [2022-12-13 13:14:55,503 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] [2022-12-13 13:14:55,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192 [2022-12-13 13:14:55,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 143 transitions, 2371 flow. Second operand has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:14:55,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:55,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192 [2022-12-13 13:14:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:57,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (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_920)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_922) |c_~#cache~0.offset|) 2147483647) (not (<= v_ArrVal_920 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_920 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_920 (+ (select .cse1 |c_~#cache~0.offset|) 1)) (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_920) (select |c_#memory_int| |c_~#cache~0.base|))))) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_919 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse2 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_919) |c_~#cache~0.base|))) (or (< (+ (select .cse2 |c_~#cache~0.offset|) 1) v_ArrVal_920) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse0) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< (select (store (store .cse2 |c_~#cache~0.offset| v_ArrVal_920) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_922) |c_~#cache~0.offset|) 2147483647)))))) is different from false [2022-12-13 13:15:02,225 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] [2022-12-13 13:15:04,235 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] [2022-12-13 13:15:07,292 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] [2022-12-13 13:15:10,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:15:17,618 INFO L130 PetriNetUnfolder]: 613/1275 cut-off events. [2022-12-13 13:15:17,618 INFO L131 PetriNetUnfolder]: For 22836/22836 co-relation queries the response was YES. [2022-12-13 13:15:17,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 1275 events. 613/1275 cut-off events. For 22836/22836 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7330 event pairs, 76 based on Foata normal form. 24/1299 useless extension candidates. Maximal degree in co-relation 9818. Up to 597 conditions per place. [2022-12-13 13:15:17,626 INFO L137 encePairwiseOnDemand]: 178/192 looper letters, 227 selfloop transitions, 176 changer transitions 0/403 dead transitions. [2022-12-13 13:15:17,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 403 transitions, 6900 flow [2022-12-13 13:15:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 13:15:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 13:15:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2983 transitions. [2022-12-13 13:15:17,630 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31072916666666667 [2022-12-13 13:15:17,630 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2983 transitions. [2022-12-13 13:15:17,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2983 transitions. [2022-12-13 13:15:17,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:15:17,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2983 transitions. [2022-12-13 13:15:17,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 59.66) internal successors, (2983), 50 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:17,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 192.0) internal successors, (9792), 51 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:17,648 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 192.0) internal successors, (9792), 51 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:17,648 INFO L175 Difference]: Start difference. First operand has 161 places, 143 transitions, 2371 flow. Second operand 50 states and 2983 transitions. [2022-12-13 13:15:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 403 transitions, 6900 flow [2022-12-13 13:15:17,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 403 transitions, 6867 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:15:17,705 INFO L231 Difference]: Finished difference. Result has 234 places, 283 transitions, 5585 flow [2022-12-13 13:15:17,705 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5585, PETRI_PLACES=234, PETRI_TRANSITIONS=283} [2022-12-13 13:15:17,705 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 207 predicate places. [2022-12-13 13:15:17,706 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 283 transitions, 5585 flow [2022-12-13 13:15:17,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:17,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:15:17,706 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:15:17,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:15:17,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 13:15:17,907 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:15:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -301656185, now seen corresponding path program 2 times [2022-12-13 13:15:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:17,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187757777] [2022-12-13 13:15:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:15:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:18,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187757777] [2022-12-13 13:15:18,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187757777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:18,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141039853] [2022-12-13 13:15:18,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:15:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:18,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:18,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:15:18,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:15:18,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:15:18,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 13:15:18,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:18,504 INFO L350 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 [2022-12-13 13:15:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:18,613 INFO L350 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 13 treesize of output 15 [2022-12-13 13:15:18,811 INFO L350 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 [2022-12-13 13:15:19,029 INFO L350 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 21 treesize of output 16 [2022-12-13 13:15:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:15:19,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:15:27,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141039853] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:27,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:27,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 13:15:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905593589] [2022-12-13 13:15:27,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:27,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 13:15:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 13:15:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=947, Unknown=5, NotChecked=0, Total=1122 [2022-12-13 13:15:30,098 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] [2022-12-13 13:15:32,198 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] [2022-12-13 13:15:34,500 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] [2022-12-13 13:15:36,700 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] [2022-12-13 13:15:38,892 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] [2022-12-13 13:15:41,290 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] [2022-12-13 13:15:43,366 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] [2022-12-13 13:15:45,634 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] [2022-12-13 13:15:48,154 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] [2022-12-13 13:15:50,363 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] [2022-12-13 13:15:52,611 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] [2022-12-13 13:15:55,066 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] [2022-12-13 13:15:55,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192 [2022-12-13 13:15:55,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 283 transitions, 5585 flow. Second operand has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:15:55,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:15:55,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192 [2022-12-13 13:15:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:15:56,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_999) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1001)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= ((as const (Array Int Int)) 0) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 13:16:03,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:05,837 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse5 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_999) |c_~#cache~0.base|))) (or (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse4) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1001)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse5) (= .cse0 (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse4) (< (select (store (store .cse1 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) 2147483647) (< (+ (select .cse1 |c_~#cache~0.offset|) 1) v_ArrVal_1001))) (or (= .cse0 .cse1) (<= (+ 28 .cse2) .cse5)) (<= (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (<= (select .cse1 .cse2) 1)))) is different from false [2022-12-13 13:16:07,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_999) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1001)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= ((as const (Array Int Int)) 0) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse1) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) 2147483647) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1001)))) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 13:16:15,189 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 70 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:16:15,668 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_999) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1001)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (exists ((v_ArrVal_1001 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1001)) (<= v_ArrVal_1001 (+ (select .cse1 |c_~#cache~0.offset|) 1)))) (= |c_~#cache~0.offset| 0) (= .cse1 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 13:16:21,648 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:16:26,623 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] [2022-12-13 13:16:28,660 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] [2022-12-13 13:16:33,393 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] [2022-12-13 13:16:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:16:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:16:39,567 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] [2022-12-13 13:16:48,513 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] [2022-12-13 13:16:52,190 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 [0, 1] [2022-12-13 13:17:08,768 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] [2022-12-13 13:17:10,774 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] [2022-12-13 13:17:16,515 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, 1] [2022-12-13 13:17:24,760 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] [2022-12-13 13:17:39,363 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] [2022-12-13 13:17:41,366 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] [2022-12-13 13:17:43,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ .cse2 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (or (< (select (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) .cse1) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ .cse2 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1001)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) .cse1) 2147483647) (not (<= v_ArrVal_1001 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse4))) (forall ((v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1001) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) .cse1) 2147483647) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1001))) (forall ((v_ArrVal_1003 Int)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1003)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483647)) (forall ((v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1003 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1001)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1003) .cse1) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse4) (< (+ (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) v_ArrVal_1001))) (forall ((v_ArrVal_1003 Int)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1003)) |c_~#cache~0.base|) .cse1) 2147483647))))) is different from false [2022-12-13 13:17:55,074 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] [2022-12-13 13:17:55,489 INFO L130 PetriNetUnfolder]: 1198/2476 cut-off events. [2022-12-13 13:17:55,490 INFO L131 PetriNetUnfolder]: For 68168/68168 co-relation queries the response was YES. [2022-12-13 13:17:55,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23656 conditions, 2476 events. 1198/2476 cut-off events. For 68168/68168 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16358 event pairs, 188 based on Foata normal form. 60/2536 useless extension candidates. Maximal degree in co-relation 23554. Up to 1273 conditions per place. [2022-12-13 13:17:55,508 INFO L137 encePairwiseOnDemand]: 176/192 looper letters, 350 selfloop transitions, 553 changer transitions 0/903 dead transitions. [2022-12-13 13:17:55,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 903 transitions, 18950 flow [2022-12-13 13:17:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-12-13 13:17:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2022-12-13 13:17:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 6152 transitions. [2022-12-13 13:17:55,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30809294871794873 [2022-12-13 13:17:55,516 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 6152 transitions. [2022-12-13 13:17:55,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 6152 transitions. [2022-12-13 13:17:55,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:17:55,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 6152 transitions. [2022-12-13 13:17:55,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 59.15384615384615) internal successors, (6152), 104 states have internal predecessors, (6152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:17:55,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 192.0) internal successors, (20160), 105 states have internal predecessors, (20160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:17:55,539 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 192.0) internal successors, (20160), 105 states have internal predecessors, (20160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:17:55,539 INFO L175 Difference]: Start difference. First operand has 234 places, 283 transitions, 5585 flow. Second operand 104 states and 6152 transitions. [2022-12-13 13:17:55,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 903 transitions, 18950 flow [2022-12-13 13:17:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 903 transitions, 18061 flow, removed 386 selfloop flow, removed 8 redundant places. [2022-12-13 13:17:55,811 INFO L231 Difference]: Finished difference. Result has 377 places, 742 transitions, 16214 flow [2022-12-13 13:17:55,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=5182, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=16214, PETRI_PLACES=377, PETRI_TRANSITIONS=742} [2022-12-13 13:17:55,811 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 350 predicate places. [2022-12-13 13:17:55,811 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 742 transitions, 16214 flow [2022-12-13 13:17:55,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:17:55,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:17:55,812 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:17:55,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:17:56,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:56,014 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:17:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:56,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1474762245, now seen corresponding path program 3 times [2022-12-13 13:17:56,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:56,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024407229] [2022-12-13 13:17:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:17:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:17:56,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024407229] [2022-12-13 13:17:56,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024407229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:56,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427649690] [2022-12-13 13:17:56,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:17:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:56,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:17:56,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:17:56,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 13:17:56,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:17:56,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 13:17:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:56,794 INFO L350 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 [2022-12-13 13:17:56,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:17:56,935 INFO L350 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 13 treesize of output 15 [2022-12-13 13:17:57,118 INFO L350 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 [2022-12-13 13:17:57,474 INFO L350 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 21 treesize of output 16 [2022-12-13 13:17:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:17:57,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:18:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:18:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427649690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:18:00,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:18:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 13:18:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74335122] [2022-12-13 13:18:00,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:18:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 13:18:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:18:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 13:18:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=956, Unknown=4, NotChecked=0, Total=1122 [2022-12-13 13:18:03,534 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] [2022-12-13 13:18:05,998 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] [2022-12-13 13:18:07,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:18:09,634 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] [2022-12-13 13:18:12,248 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] [2022-12-13 13:18:12,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192 [2022-12-13 13:18:12,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 742 transitions, 16214 flow. Second operand has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:18:12,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:18:12,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192 [2022-12-13 13:18:12,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:18:17,325 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1079 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1079) |c_~#cache~0.base|))) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1080) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1080) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1080 Int)) (and (<= v_ArrVal_1080 (+ (select .cse1 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1080)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= .cse1 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 13:18:17,350 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse3 |c_~#cache~0.offset|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1080 Int)) (and (<= v_ArrVal_1080 (+ (select .cse0 .cse1) 1)) (= (store .cse0 .cse1 v_ArrVal_1080) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1079 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (let ((.cse2 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1079) |c_~#cache~0.base|))) (or (< (+ (select .cse2 |c_~#cache~0.offset|) 1) v_ArrVal_1080) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (select (store (store .cse2 |c_~#cache~0.offset| v_ArrVal_1080) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1080)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (not (<= v_ArrVal_1080 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (and (= (store (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1080) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1082) (select |c_#memory_int| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= v_ArrVal_1080 (+ (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse0 (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (let ((.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or (and (not .cse5) (<= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) .cse6) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) .cse6 .cse5))) (<= (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)))) is different from false [2022-12-13 13:18:19,403 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] [2022-12-13 13:18:21,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:18:29,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1079 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1079) |c_~#cache~0.base|))) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1080) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1080) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1080 Int)) (and (<= v_ArrVal_1080 (+ (select .cse1 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1080)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (and (= (store (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1080) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1082) (select |c_#memory_int| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= v_ArrVal_1080 (+ (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1)))) (= |c_~#cache~0.offset| 0) (= .cse1 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-12-13 13:18:29,717 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse8 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse6 (+ .cse8 28 |c_~#cache~0.offset|)) (.cse2 (@diff .cse1 .cse0)) (.cse7 (+ .cse8 |c_~#cache~0.offset|)) (.cse4 (@diff .cse3 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (= .cse0 (store .cse3 .cse4 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1079 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (let ((.cse5 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1079) |c_~#cache~0.base|))) (or (< (+ (select .cse5 |c_~#cache~0.offset|) 1) v_ArrVal_1080) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_1080) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse6) (< (+ (select .cse3 .cse7) 1) v_ArrVal_1080) (< (select (store (store .cse3 .cse7 v_ArrVal_1080) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse6) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1080)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (not (<= v_ArrVal_1080 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1080 Int) (v_ArrVal_1082 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse6) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1080)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1082) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) v_ArrVal_1080))) (or (= .cse0 .cse1) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (<= (select .cse1 .cse2) 1))) (or (= .cse0 .cse3) (<= (+ 28 .cse4) .cse7)) (<= (select .cse3 .cse4) 1)))) is different from false [2022-12-13 13:18:32,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:18:38,853 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 86 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:18:48,180 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] [2022-12-13 13:18:58,505 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] [2022-12-13 13:19:06,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:15,731 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, 1] [2022-12-13 13:19:24,657 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] [2022-12-13 13:19:31,958 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] [2022-12-13 13:19:34,025 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] [2022-12-13 13:19:57,553 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 [1] [2022-12-13 13:20:01,973 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] [2022-12-13 13:20:06,345 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] [2022-12-13 13:20:22,865 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, 1] [2022-12-13 13:20:25,954 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] [2022-12-13 13:20:27,993 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] [2022-12-13 13:20:45,535 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] [2022-12-13 13:21:05,691 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] [2022-12-13 13:21:07,697 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] [2022-12-13 13:21:20,882 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] [2022-12-13 13:21:29,535 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] [2022-12-13 13:21:38,068 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] [2022-12-13 13:21:45,324 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] [2022-12-13 13:21:47,352 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] [2022-12-13 13:21:56,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:21:58,154 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] [2022-12-13 13:22:11,761 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] [2022-12-13 13:22:13,836 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, 1] [2022-12-13 13:22:15,869 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] [2022-12-13 13:22:44,351 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] [2022-12-13 13:23:09,266 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] [2022-12-13 13:23:35,074 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] [2022-12-13 13:24:20,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] [2022-12-13 13:25:03,461 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] [2022-12-13 13:25:17,025 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] [2022-12-13 13:25:30,889 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] [2022-12-13 13:25:56,882 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] [2022-12-13 13:25:58,905 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] [2022-12-13 13:26:10,380 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] [2022-12-13 13:26:12,392 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] [2022-12-13 13:26:27,600 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] [2022-12-13 13:26:29,631 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] [2022-12-13 13:26:44,719 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] [2022-12-13 13:26:46,872 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] [2022-12-13 13:26:48,902 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] [2022-12-13 13:26:50,972 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] [2022-12-13 13:26:53,210 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] [2022-12-13 13:26:53,459 INFO L130 PetriNetUnfolder]: 1681/3521 cut-off events. [2022-12-13 13:26:53,459 INFO L131 PetriNetUnfolder]: For 201991/201991 co-relation queries the response was YES. [2022-12-13 13:26:53,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44826 conditions, 3521 events. 1681/3521 cut-off events. For 201991/201991 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25711 event pairs, 108 based on Foata normal form. 48/3569 useless extension candidates. Maximal degree in co-relation 44676. Up to 1242 conditions per place. [2022-12-13 13:26:53,502 INFO L137 encePairwiseOnDemand]: 177/192 looper letters, 434 selfloop transitions, 1058 changer transitions 0/1492 dead transitions. [2022-12-13 13:26:53,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1492 transitions, 36179 flow [2022-12-13 13:26:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-13 13:26:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-12-13 13:26:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 7148 transitions. [2022-12-13 13:26:53,520 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3076790633608815 [2022-12-13 13:26:53,521 INFO L72 ComplementDD]: Start complementDD. Operand 121 states and 7148 transitions. [2022-12-13 13:26:53,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 7148 transitions. [2022-12-13 13:26:53,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:26:53,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 121 states and 7148 transitions. [2022-12-13 13:26:53,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 122 states, 121 states have (on average 59.074380165289256) internal successors, (7148), 121 states have internal predecessors, (7148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:26:53,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 122 states, 122 states have (on average 192.0) internal successors, (23424), 122 states have internal predecessors, (23424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:26:53,544 INFO L81 ComplementDD]: Finished complementDD. Result has 122 states, 122 states have (on average 192.0) internal successors, (23424), 122 states have internal predecessors, (23424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:26:53,544 INFO L175 Difference]: Start difference. First operand has 377 places, 742 transitions, 16214 flow. Second operand 121 states and 7148 transitions. [2022-12-13 13:26:53,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1492 transitions, 36179 flow [2022-12-13 13:26:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1492 transitions, 34124 flow, removed 1016 selfloop flow, removed 4 redundant places. [2022-12-13 13:26:54,493 INFO L231 Difference]: Finished difference. Result has 545 places, 1305 transitions, 31824 flow [2022-12-13 13:26:54,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=15184, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=121, PETRI_FLOW=31824, PETRI_PLACES=545, PETRI_TRANSITIONS=1305} [2022-12-13 13:26:54,494 INFO L288 CegarLoopForPetriNet]: 27 programPoint places, 518 predicate places. [2022-12-13 13:26:54,494 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 1305 transitions, 31824 flow [2022-12-13 13:26:54,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 56.3235294117647) internal successors, (1915), 34 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:26:54,494 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:26:54,494 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:26:54,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:26:54,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 13:26:54,696 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-12-13 13:26:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:26:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -452937409, now seen corresponding path program 1 times [2022-12-13 13:26:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:26:54,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092917856] [2022-12-13 13:26:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:26:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:26:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:26:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:26:55,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:26:55,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092917856] [2022-12-13 13:26:55,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092917856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:26:55,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057983184] [2022-12-13 13:26:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:26:55,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:26:55,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:26:55,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:26:55,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e38cb2-aacd-42cb-814f-e2ea552ae3e6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:26:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:26:55,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 13:26:55,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:26:55,267 INFO L350 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 [2022-12-13 13:26:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:26:55,409 INFO L350 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 13 treesize of output 15 [2022-12-13 13:26:55,661 INFO L350 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 [2022-12-13 13:26:55,963 INFO L350 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 21 treesize of output 16 [2022-12-13 13:26:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:26:56,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:26:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 13:26:57,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057983184] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:26:57,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:26:57,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-12-13 13:26:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091379319] [2022-12-13 13:26:57,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:26:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 13:26:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:26:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 13:26:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=773, Unknown=6, NotChecked=0, Total=930 [2022-12-13 13:27:00,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 192 [2022-12-13 13:27:00,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 1305 transitions, 31824 flow. Second operand has 31 states, 31 states have (on average 62.45161290322581) internal successors, (1936), 31 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:00,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:27:00,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 192 [2022-12-13 13:27:00,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:27:05,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1159 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1159) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1162) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse0 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-12-13 13:27:07,572 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, 1] [2022-12-13 13:27:07,625 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1161 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse0 0 v_ArrVal_1161))) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1159 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1159) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1162) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (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_1161)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1162) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|) 2147483647))) (exists ((v_ArrVal_1161 Int)) (= (store .cse0 |c_~#cache~0.offset| v_ArrVal_1161) (select |c_#memory_int| |c_~#cache~0.base|))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-12-13 13:27:09,736 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] [2022-12-13 13:27:10,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]