./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8 --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 8d24e1fe59577ae07a5b7a898c9dc79f871eafbb8fdf9529a0c24eed9c094f3d --- 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-e04fb08 [2022-11-16 10:54:56,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:54:56,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:54:56,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:54:56,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:54:56,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:54:56,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:54:56,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:54:56,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:54:56,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:54:56,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:54:56,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:54:56,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:54:56,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:54:56,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:54:56,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:54:56,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:54:56,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:54:56,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:54:56,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:54:56,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:54:56,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:54:56,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:54:56,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:54:56,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:54:56,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:54:56,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:54:56,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:54:56,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:54:56,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:54:56,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:54:56,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:54:56,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:54:56,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:54:56,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:54:56,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:54:56,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:54:56,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:54:56,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:54:56,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:54:56,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:54:56,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-16 10:54:56,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:54:56,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:54:56,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:54:56,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:54:56,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:54:56,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:54:56,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:54:56,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:54:56,853 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:54:56,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:54:56,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:54:56,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:54:56,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:54:56,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:54:56,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:54:56,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:54:56,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:54:56,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:54:56,855 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 10:54:56,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:54:56,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:54:56,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:54:56,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:54:56,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:54:56,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:54:56,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:54:56,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:56,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:54:56,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:54:56,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:54:56,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:54:56,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:54:56,858 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:54:56,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:54:56,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:54:56,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/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_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8 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 -> 8d24e1fe59577ae07a5b7a898c9dc79f871eafbb8fdf9529a0c24eed9c094f3d [2022-11-16 10:54:57,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:54:57,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:54:57,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:54:57,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:54:57,207 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:54:57,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2022-11-16 10:54:57,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/data/6a8e4a8c0/72e61bf84cb146c09079643a8430bf82/FLAG03b500b27 [2022-11-16 10:54:58,026 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:54:58,032 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2022-11-16 10:54:58,052 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/data/6a8e4a8c0/72e61bf84cb146c09079643a8430bf82/FLAG03b500b27 [2022-11-16 10:54:58,224 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/data/6a8e4a8c0/72e61bf84cb146c09079643a8430bf82 [2022-11-16 10:54:58,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:54:58,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:54:58,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:58,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:54:58,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:54:58,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:58" (1/1) ... [2022-11-16 10:54:58,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af15592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:58, skipping insertion in model container [2022-11-16 10:54:58,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:58" (1/1) ... [2022-11-16 10:54:58,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:54:58,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:54:58,857 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i[41323,41336] [2022-11-16 10:54:58,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:58,901 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:54:58,944 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i[41323,41336] [2022-11-16 10:54:58,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:59,055 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:54:59,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59 WrapperNode [2022-11-16 10:54:59,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:59,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:59,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:54:59,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:54:59,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,143 INFO L138 Inliner]: procedures = 273, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-16 10:54:59,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:59,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:54:59,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:54:59,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:54:59,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,179 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:54:59,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:54:59,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:54:59,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:54:59,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (1/1) ... [2022-11-16 10:54:59,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:59,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:59,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:54:59,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:54:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:54:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:54:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 10:54:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:54:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 10:54:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:54:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 10:54:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 10:54:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:54:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:54:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:54:59,290 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 10:54:59,548 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:54:59,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:54:59,993 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:55:00,001 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:55:00,002 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-16 10:55:00,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:00 BoogieIcfgContainer [2022-11-16 10:55:00,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:55:00,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:55:00,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:55:00,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:55:00,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:54:58" (1/3) ... [2022-11-16 10:55:00,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115d390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:00, skipping insertion in model container [2022-11-16 10:55:00,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:59" (2/3) ... [2022-11-16 10:55:00,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115d390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:00, skipping insertion in model container [2022-11-16 10:55:00,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:00" (3/3) ... [2022-11-16 10:55:00,015 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2022-11-16 10:55:00,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 10:55:00,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:55:00,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-16 10:55:00,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:55:00,116 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 10:55:00,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 178 transitions, 364 flow [2022-11-16 10:55:00,331 INFO L130 PetriNetUnfolder]: 24/217 cut-off events. [2022-11-16 10:55:00,332 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 10:55:00,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 217 events. 24/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 631 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 130. Up to 4 conditions per place. [2022-11-16 10:55:00,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 178 transitions, 364 flow [2022-11-16 10:55:00,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 175 transitions, 358 flow [2022-11-16 10:55:00,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:00,384 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;@59c0fbf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:00,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-16 10:55:00,407 INFO L130 PetriNetUnfolder]: 1/61 cut-off events. [2022-11-16 10:55:00,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:00,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:00,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:00,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 10:55:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash -190114343, now seen corresponding path program 1 times [2022-11-16 10:55:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550070536] [2022-11-16 10:55:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:00,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550070536] [2022-11-16 10:55:00,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550070536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:00,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:00,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:00,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770196188] [2022-11-16 10:55:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:00,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:00,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 178 [2022-11-16 10:55:00,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 175 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-11-16 10:55:00,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:00,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 178 [2022-11-16 10:55:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:01,041 INFO L130 PetriNetUnfolder]: 1/159 cut-off events. [2022-11-16 10:55:01,041 INFO L131 PetriNetUnfolder]: For 3/12 co-relation queries the response was YES. [2022-11-16 10:55:01,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 159 events. 1/159 cut-off events. For 3/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs, 0 based on Foata normal form. 55/201 useless extension candidates. Maximal degree in co-relation 118. Up to 7 conditions per place. [2022-11-16 10:55:01,046 INFO L137 encePairwiseOnDemand]: 154/178 looper letters, 10 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2022-11-16 10:55:01,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2022-11-16 10:55:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 801 transitions. [2022-11-16 10:55:01,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-11-16 10:55:01,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 801 transitions. [2022-11-16 10:55:01,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 801 transitions. [2022-11-16 10:55:01,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:01,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 801 transitions. [2022-11-16 10:55:01,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.2) internal successors, (801), 5 states have internal predecessors, (801), 0 states have call successors, (0), 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-11-16 10:55:01,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 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-11-16 10:55:01,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 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-11-16 10:55:01,097 INFO L175 Difference]: Start difference. First operand has 160 places, 175 transitions, 358 flow. Second operand 5 states and 801 transitions. [2022-11-16 10:55:01,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2022-11-16 10:55:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:01,108 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 330 flow [2022-11-16 10:55:01,110 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2022-11-16 10:55:01,116 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2022-11-16 10:55:01,117 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 330 flow [2022-11-16 10:55:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-11-16 10:55:01,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:01,119 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:55:01,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 10:55:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1626144710, now seen corresponding path program 1 times [2022-11-16 10:55:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151157924] [2022-11-16 10:55:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:01,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:55:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:01,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:55:01,234 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:55:01,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-16 10:55:01,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-16 10:55:01,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-16 10:55:01,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-16 10:55:01,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-16 10:55:01,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-16 10:55:01,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-16 10:55:01,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-16 10:55:01,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-16 10:55:01,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-16 10:55:01,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-16 10:55:01,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-16 10:55:01,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-16 10:55:01,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-16 10:55:01,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-16 10:55:01,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-16 10:55:01,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-16 10:55:01,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-16 10:55:01,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-16 10:55:01,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-16 10:55:01,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-16 10:55:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:55:01,245 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-16 10:55:01,247 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 10:55:01,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 10:55:01,308 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 10:55:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 262 transitions, 542 flow [2022-11-16 10:55:01,419 INFO L130 PetriNetUnfolder]: 45/377 cut-off events. [2022-11-16 10:55:01,419 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 10:55:01,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 377 events. 45/377 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1430 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 232. Up to 8 conditions per place. [2022-11-16 10:55:01,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 262 transitions, 542 flow [2022-11-16 10:55:01,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 262 transitions, 542 flow [2022-11-16 10:55:01,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:01,442 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;@59c0fbf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:01,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-16 10:55:01,449 INFO L130 PetriNetUnfolder]: 1/61 cut-off events. [2022-11-16 10:55:01,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:01,450 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:01,450 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:01,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -367714709, now seen corresponding path program 1 times [2022-11-16 10:55:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:01,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310353785] [2022-11-16 10:55:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310353785] [2022-11-16 10:55:01,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310353785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:01,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:01,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454757987] [2022-11-16 10:55:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:01,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:01,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 262 [2022-11-16 10:55:01,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 262 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 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-11-16 10:55:01,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:01,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 262 [2022-11-16 10:55:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:01,771 INFO L130 PetriNetUnfolder]: 4/312 cut-off events. [2022-11-16 10:55:01,771 INFO L131 PetriNetUnfolder]: For 25/67 co-relation queries the response was YES. [2022-11-16 10:55:01,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 312 events. 4/312 cut-off events. For 25/67 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 984 event pairs, 0 based on Foata normal form. 141/419 useless extension candidates. Maximal degree in co-relation 212. Up to 21 conditions per place. [2022-11-16 10:55:01,777 INFO L137 encePairwiseOnDemand]: 226/262 looper letters, 19 selfloop transitions, 4 changer transitions 0/239 dead transitions. [2022-11-16 10:55:01,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 239 transitions, 542 flow [2022-11-16 10:55:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1172 transitions. [2022-11-16 10:55:01,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946564885496183 [2022-11-16 10:55:01,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1172 transitions. [2022-11-16 10:55:01,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1172 transitions. [2022-11-16 10:55:01,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:01,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1172 transitions. [2022-11-16 10:55:01,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.4) internal successors, (1172), 5 states have internal predecessors, (1172), 0 states have call successors, (0), 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-11-16 10:55:01,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:01,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:01,791 INFO L175 Difference]: Start difference. First operand has 234 places, 262 transitions, 542 flow. Second operand 5 states and 1172 transitions. [2022-11-16 10:55:01,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 239 transitions, 542 flow [2022-11-16 10:55:01,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 239 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:01,798 INFO L231 Difference]: Finished difference. Result has 240 places, 235 transitions, 514 flow [2022-11-16 10:55:01,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=514, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2022-11-16 10:55:01,799 INFO L288 CegarLoopForPetriNet]: 234 programPoint places, 6 predicate places. [2022-11-16 10:55:01,800 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 514 flow [2022-11-16 10:55:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 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-11-16 10:55:01,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:01,801 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:01,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:55:01,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1357296752, now seen corresponding path program 1 times [2022-11-16 10:55:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:01,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383546736] [2022-11-16 10:55:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:01,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:55:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:01,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383546736] [2022-11-16 10:55:01,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383546736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:01,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:01,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819526910] [2022-11-16 10:55:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:01,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 262 [2022-11-16 10:55:01,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 0 states have call successors, (0), 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-11-16 10:55:01,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:01,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 262 [2022-11-16 10:55:01,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:02,003 INFO L130 PetriNetUnfolder]: 4/311 cut-off events. [2022-11-16 10:55:02,004 INFO L131 PetriNetUnfolder]: For 32/71 co-relation queries the response was YES. [2022-11-16 10:55:02,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 311 events. 4/311 cut-off events. For 32/71 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 977 event pairs, 0 based on Foata normal form. 7/288 useless extension candidates. Maximal degree in co-relation 294. Up to 10 conditions per place. [2022-11-16 10:55:02,009 INFO L137 encePairwiseOnDemand]: 256/262 looper letters, 11 selfloop transitions, 8 changer transitions 0/235 dead transitions. [2022-11-16 10:55:02,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 235 transitions, 550 flow [2022-11-16 10:55:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1097 transitions. [2022-11-16 10:55:02,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8374045801526717 [2022-11-16 10:55:02,013 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1097 transitions. [2022-11-16 10:55:02,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1097 transitions. [2022-11-16 10:55:02,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:02,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1097 transitions. [2022-11-16 10:55:02,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 219.4) internal successors, (1097), 5 states have internal predecessors, (1097), 0 states have call successors, (0), 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-11-16 10:55:02,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:02,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:02,021 INFO L175 Difference]: Start difference. First operand has 240 places, 235 transitions, 514 flow. Second operand 5 states and 1097 transitions. [2022-11-16 10:55:02,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 235 transitions, 550 flow [2022-11-16 10:55:02,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 235 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:02,027 INFO L231 Difference]: Finished difference. Result has 243 places, 235 transitions, 532 flow [2022-11-16 10:55:02,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=243, PETRI_TRANSITIONS=235} [2022-11-16 10:55:02,028 INFO L288 CegarLoopForPetriNet]: 234 programPoint places, 9 predicate places. [2022-11-16 10:55:02,028 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 235 transitions, 532 flow [2022-11-16 10:55:02,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 0 states have call successors, (0), 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-11-16 10:55:02,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:02,029 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:02,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:55:02,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1353570917, now seen corresponding path program 1 times [2022-11-16 10:55:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:02,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116706981] [2022-11-16 10:55:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:02,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:02,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116706981] [2022-11-16 10:55:02,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116706981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:02,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:02,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687658024] [2022-11-16 10:55:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:02,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:02,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:02,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 262 [2022-11-16 10:55:02,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 235 transitions, 532 flow. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 0 states have call successors, (0), 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-11-16 10:55:02,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:02,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 262 [2022-11-16 10:55:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:02,859 INFO L130 PetriNetUnfolder]: 479/2630 cut-off events. [2022-11-16 10:55:02,859 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-11-16 10:55:02,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 2630 events. 479/2630 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 24455 event pairs, 135 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 2351. Up to 579 conditions per place. [2022-11-16 10:55:02,890 INFO L137 encePairwiseOnDemand]: 253/262 looper letters, 53 selfloop transitions, 9 changer transitions 0/269 dead transitions. [2022-11-16 10:55:02,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 269 transitions, 742 flow [2022-11-16 10:55:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1086 transitions. [2022-11-16 10:55:02,894 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8290076335877863 [2022-11-16 10:55:02,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1086 transitions. [2022-11-16 10:55:02,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1086 transitions. [2022-11-16 10:55:02,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:02,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1086 transitions. [2022-11-16 10:55:02,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 217.2) internal successors, (1086), 5 states have internal predecessors, (1086), 0 states have call successors, (0), 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-11-16 10:55:02,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:02,902 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:02,902 INFO L175 Difference]: Start difference. First operand has 243 places, 235 transitions, 532 flow. Second operand 5 states and 1086 transitions. [2022-11-16 10:55:02,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 269 transitions, 742 flow [2022-11-16 10:55:02,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 269 transitions, 730 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 10:55:02,910 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 591 flow [2022-11-16 10:55:02,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2022-11-16 10:55:02,912 INFO L288 CegarLoopForPetriNet]: 234 programPoint places, 13 predicate places. [2022-11-16 10:55:02,912 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 591 flow [2022-11-16 10:55:02,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 0 states have call successors, (0), 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-11-16 10:55:02,913 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:02,913 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:02,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:55:02,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 873474204, now seen corresponding path program 1 times [2022-11-16 10:55:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:02,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924679543] [2022-11-16 10:55:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924679543] [2022-11-16 10:55:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924679543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:03,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540200891] [2022-11-16 10:55:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:03,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:03,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 10:55:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:03,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:55:03,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:03,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:03,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540200891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:03,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:03,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-16 10:55:03,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064908142] [2022-11-16 10:55:03,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:03,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:03,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:03,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:03,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:03,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 262 [2022-11-16 10:55:03,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 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-11-16 10:55:03,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:03,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 262 [2022-11-16 10:55:03,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:03,553 INFO L130 PetriNetUnfolder]: 13/578 cut-off events. [2022-11-16 10:55:03,553 INFO L131 PetriNetUnfolder]: For 96/207 co-relation queries the response was YES. [2022-11-16 10:55:03,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 578 events. 13/578 cut-off events. For 96/207 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2743 event pairs, 0 based on Foata normal form. 11/527 useless extension candidates. Maximal degree in co-relation 545. Up to 21 conditions per place. [2022-11-16 10:55:03,563 INFO L137 encePairwiseOnDemand]: 257/262 looper letters, 15 selfloop transitions, 6 changer transitions 0/245 dead transitions. [2022-11-16 10:55:03,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 245 transitions, 635 flow [2022-11-16 10:55:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:55:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 10:55:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1534 transitions. [2022-11-16 10:55:03,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.836423118865867 [2022-11-16 10:55:03,567 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1534 transitions. [2022-11-16 10:55:03,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1534 transitions. [2022-11-16 10:55:03,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:03,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1534 transitions. [2022-11-16 10:55:03,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.14285714285714) internal successors, (1534), 7 states have internal predecessors, (1534), 0 states have call successors, (0), 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-11-16 10:55:03,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 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-11-16 10:55:03,577 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 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-11-16 10:55:03,577 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 591 flow. Second operand 7 states and 1534 transitions. [2022-11-16 10:55:03,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 245 transitions, 635 flow [2022-11-16 10:55:03,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 245 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:03,585 INFO L231 Difference]: Finished difference. Result has 251 places, 242 transitions, 594 flow [2022-11-16 10:55:03,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=594, PETRI_PLACES=251, PETRI_TRANSITIONS=242} [2022-11-16 10:55:03,590 INFO L288 CegarLoopForPetriNet]: 234 programPoint places, 17 predicate places. [2022-11-16 10:55:03,590 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 242 transitions, 594 flow [2022-11-16 10:55:03,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 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-11-16 10:55:03,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:03,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:03,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:03,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:03,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2097919965, now seen corresponding path program 1 times [2022-11-16 10:55:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:03,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753036867] [2022-11-16 10:55:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:03,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753036867] [2022-11-16 10:55:03,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753036867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:03,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:03,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675508267] [2022-11-16 10:55:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:03,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:03,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 262 [2022-11-16 10:55:03,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 242 transitions, 594 flow. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 0 states have call successors, (0), 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-11-16 10:55:03,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:03,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 262 [2022-11-16 10:55:03,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:04,580 INFO L130 PetriNetUnfolder]: 509/2673 cut-off events. [2022-11-16 10:55:04,580 INFO L131 PetriNetUnfolder]: For 379/379 co-relation queries the response was YES. [2022-11-16 10:55:04,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3923 conditions, 2673 events. 509/2673 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 24896 event pairs, 150 based on Foata normal form. 0/2398 useless extension candidates. Maximal degree in co-relation 2699. Up to 635 conditions per place. [2022-11-16 10:55:04,611 INFO L137 encePairwiseOnDemand]: 253/262 looper letters, 53 selfloop transitions, 11 changer transitions 0/271 dead transitions. [2022-11-16 10:55:04,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 271 transitions, 812 flow [2022-11-16 10:55:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1086 transitions. [2022-11-16 10:55:04,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8290076335877863 [2022-11-16 10:55:04,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1086 transitions. [2022-11-16 10:55:04,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1086 transitions. [2022-11-16 10:55:04,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:04,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1086 transitions. [2022-11-16 10:55:04,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 217.2) internal successors, (1086), 5 states have internal predecessors, (1086), 0 states have call successors, (0), 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-11-16 10:55:04,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:04,624 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 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-11-16 10:55:04,624 INFO L175 Difference]: Start difference. First operand has 251 places, 242 transitions, 594 flow. Second operand 5 states and 1086 transitions. [2022-11-16 10:55:04,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 271 transitions, 812 flow [2022-11-16 10:55:04,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 271 transitions, 801 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-16 10:55:04,634 INFO L231 Difference]: Finished difference. Result has 253 places, 246 transitions, 644 flow [2022-11-16 10:55:04,634 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=644, PETRI_PLACES=253, PETRI_TRANSITIONS=246} [2022-11-16 10:55:04,636 INFO L288 CegarLoopForPetriNet]: 234 programPoint places, 19 predicate places. [2022-11-16 10:55:04,636 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 246 transitions, 644 flow [2022-11-16 10:55:04,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 0 states have call successors, (0), 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-11-16 10:55:04,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:04,637 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:55:04,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 10:55:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash 928182735, now seen corresponding path program 1 times [2022-11-16 10:55:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787300852] [2022-11-16 10:55:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:04,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:55:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:04,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:55:04,708 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:55:04,710 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-16 10:55:04,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-16 10:55:04,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-16 10:55:04,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-16 10:55:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-16 10:55:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-16 10:55:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-16 10:55:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-16 10:55:04,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-16 10:55:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-16 10:55:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-16 10:55:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-16 10:55:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-16 10:55:04,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-16 10:55:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-16 10:55:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-16 10:55:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-16 10:55:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-16 10:55:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-16 10:55:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-16 10:55:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-16 10:55:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-16 10:55:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-16 10:55:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-16 10:55:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-16 10:55:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-16 10:55:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-16 10:55:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-16 10:55:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-16 10:55:04,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:55:04,720 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 10:55:04,722 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 10:55:04,722 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 10:55:04,768 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 10:55:04,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 346 transitions, 722 flow [2022-11-16 10:55:04,919 INFO L130 PetriNetUnfolder]: 71/578 cut-off events. [2022-11-16 10:55:04,920 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 10:55:04,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 578 events. 71/578 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2414 event pairs, 1 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 385. Up to 16 conditions per place. [2022-11-16 10:55:04,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 346 transitions, 722 flow [2022-11-16 10:55:04,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 346 transitions, 722 flow [2022-11-16 10:55:04,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:04,955 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;@59c0fbf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:04,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-11-16 10:55:04,961 INFO L130 PetriNetUnfolder]: 1/61 cut-off events. [2022-11-16 10:55:04,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:04,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:04,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:04,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1537341565, now seen corresponding path program 1 times [2022-11-16 10:55:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440695715] [2022-11-16 10:55:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:05,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440695715] [2022-11-16 10:55:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440695715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:05,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:05,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315557515] [2022-11-16 10:55:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:05,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 346 [2022-11-16 10:55:05,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 346 transitions, 722 flow. Second operand has 4 states, 4 states have (on average 287.75) internal successors, (1151), 4 states have internal predecessors, (1151), 0 states have call successors, (0), 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-11-16 10:55:05,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:05,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 346 [2022-11-16 10:55:05,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:05,268 INFO L130 PetriNetUnfolder]: 10/492 cut-off events. [2022-11-16 10:55:05,268 INFO L131 PetriNetUnfolder]: For 73/199 co-relation queries the response was YES. [2022-11-16 10:55:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 492 events. 10/492 cut-off events. For 73/199 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1946 event pairs, 1 based on Foata normal form. 389/822 useless extension candidates. Maximal degree in co-relation 352. Up to 40 conditions per place. [2022-11-16 10:55:05,278 INFO L137 encePairwiseOnDemand]: 298/346 looper letters, 21 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-16 10:55:05,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 311 transitions, 702 flow [2022-11-16 10:55:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1536 transitions. [2022-11-16 10:55:05,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8878612716763006 [2022-11-16 10:55:05,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1536 transitions. [2022-11-16 10:55:05,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1536 transitions. [2022-11-16 10:55:05,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:05,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1536 transitions. [2022-11-16 10:55:05,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.2) internal successors, (1536), 5 states have internal predecessors, (1536), 0 states have call successors, (0), 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-11-16 10:55:05,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:05,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:05,292 INFO L175 Difference]: Start difference. First operand has 306 places, 346 transitions, 722 flow. Second operand 5 states and 1536 transitions. [2022-11-16 10:55:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 311 transitions, 702 flow [2022-11-16 10:55:05,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 311 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:05,299 INFO L231 Difference]: Finished difference. Result has 312 places, 307 transitions, 670 flow [2022-11-16 10:55:05,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=312, PETRI_TRANSITIONS=307} [2022-11-16 10:55:05,301 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 6 predicate places. [2022-11-16 10:55:05,301 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 307 transitions, 670 flow [2022-11-16 10:55:05,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 287.75) internal successors, (1151), 4 states have internal predecessors, (1151), 0 states have call successors, (0), 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-11-16 10:55:05,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:05,303 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:05,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:55:05,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 108721524, now seen corresponding path program 1 times [2022-11-16 10:55:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:05,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391670990] [2022-11-16 10:55:05,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:55:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391670990] [2022-11-16 10:55:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391670990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:05,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:05,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679788083] [2022-11-16 10:55:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:05,370 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 346 [2022-11-16 10:55:05,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 307 transitions, 670 flow. Second operand has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 0 states have call successors, (0), 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-11-16 10:55:05,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:05,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 346 [2022-11-16 10:55:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:05,531 INFO L130 PetriNetUnfolder]: 10/490 cut-off events. [2022-11-16 10:55:05,531 INFO L131 PetriNetUnfolder]: For 80/197 co-relation queries the response was YES. [2022-11-16 10:55:05,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 490 events. 10/490 cut-off events. For 80/197 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1936 event pairs, 1 based on Foata normal form. 11/449 useless extension candidates. Maximal degree in co-relation 509. Up to 20 conditions per place. [2022-11-16 10:55:05,544 INFO L137 encePairwiseOnDemand]: 340/346 looper letters, 13 selfloop transitions, 8 changer transitions 0/307 dead transitions. [2022-11-16 10:55:05,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 307 transitions, 710 flow [2022-11-16 10:55:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1449 transitions. [2022-11-16 10:55:05,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8375722543352602 [2022-11-16 10:55:05,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1449 transitions. [2022-11-16 10:55:05,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1449 transitions. [2022-11-16 10:55:05,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:05,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1449 transitions. [2022-11-16 10:55:05,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 289.8) internal successors, (1449), 5 states have internal predecessors, (1449), 0 states have call successors, (0), 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-11-16 10:55:05,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:05,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:05,557 INFO L175 Difference]: Start difference. First operand has 312 places, 307 transitions, 670 flow. Second operand 5 states and 1449 transitions. [2022-11-16 10:55:05,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 307 transitions, 710 flow [2022-11-16 10:55:05,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:05,564 INFO L231 Difference]: Finished difference. Result has 315 places, 307 transitions, 688 flow [2022-11-16 10:55:05,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=688, PETRI_PLACES=315, PETRI_TRANSITIONS=307} [2022-11-16 10:55:05,565 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 9 predicate places. [2022-11-16 10:55:05,566 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 307 transitions, 688 flow [2022-11-16 10:55:05,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 0 states have call successors, (0), 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-11-16 10:55:05,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:05,567 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:55:05,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash -296129491, now seen corresponding path program 1 times [2022-11-16 10:55:05,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:05,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318065212] [2022-11-16 10:55:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:05,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:05,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318065212] [2022-11-16 10:55:05,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318065212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:05,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:05,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453317623] [2022-11-16 10:55:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:05,663 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 346 [2022-11-16 10:55:05,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 307 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-16 10:55:05,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:05,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 346 [2022-11-16 10:55:05,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:12,035 INFO L130 PetriNetUnfolder]: 8409/30796 cut-off events. [2022-11-16 10:55:12,035 INFO L131 PetriNetUnfolder]: For 2606/2606 co-relation queries the response was YES. [2022-11-16 10:55:12,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43840 conditions, 30796 events. 8409/30796 cut-off events. For 2606/2606 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 416187 event pairs, 2861 based on Foata normal form. 0/27091 useless extension candidates. Maximal degree in co-relation 13928. Up to 9129 conditions per place. [2022-11-16 10:55:12,507 INFO L137 encePairwiseOnDemand]: 335/346 looper letters, 79 selfloop transitions, 13 changer transitions 0/361 dead transitions. [2022-11-16 10:55:12,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 361 transitions, 1022 flow [2022-11-16 10:55:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1426 transitions. [2022-11-16 10:55:12,511 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242774566473988 [2022-11-16 10:55:12,512 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1426 transitions. [2022-11-16 10:55:12,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1426 transitions. [2022-11-16 10:55:12,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:12,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1426 transitions. [2022-11-16 10:55:12,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 285.2) internal successors, (1426), 5 states have internal predecessors, (1426), 0 states have call successors, (0), 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-11-16 10:55:12,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:12,522 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:12,522 INFO L175 Difference]: Start difference. First operand has 315 places, 307 transitions, 688 flow. Second operand 5 states and 1426 transitions. [2022-11-16 10:55:12,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 361 transitions, 1022 flow [2022-11-16 10:55:12,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 361 transitions, 1010 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 10:55:12,532 INFO L231 Difference]: Finished difference. Result has 319 places, 319 transitions, 777 flow [2022-11-16 10:55:12,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=319, PETRI_TRANSITIONS=319} [2022-11-16 10:55:12,534 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 13 predicate places. [2022-11-16 10:55:12,534 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 319 transitions, 777 flow [2022-11-16 10:55:12,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-16 10:55:12,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:12,535 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:12,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:55:12,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -924599150, now seen corresponding path program 1 times [2022-11-16 10:55:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:12,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796783352] [2022-11-16 10:55:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:12,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:12,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796783352] [2022-11-16 10:55:12,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796783352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:12,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316815772] [2022-11-16 10:55:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:12,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:12,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:12,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 10:55:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:55:12,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:12,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316815772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-16 10:55:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73047580] [2022-11-16 10:55:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:12,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:12,991 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 346 [2022-11-16 10:55:12,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 319 transitions, 777 flow. Second operand has 6 states, 6 states have (on average 288.6666666666667) internal successors, (1732), 6 states have internal predecessors, (1732), 0 states have call successors, (0), 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-11-16 10:55:12,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:12,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 346 [2022-11-16 10:55:12,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:13,542 INFO L130 PetriNetUnfolder]: 111/1847 cut-off events. [2022-11-16 10:55:13,542 INFO L131 PetriNetUnfolder]: For 409/1016 co-relation queries the response was YES. [2022-11-16 10:55:13,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1847 events. 111/1847 cut-off events. For 409/1016 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 14479 event pairs, 27 based on Foata normal form. 30/1649 useless extension candidates. Maximal degree in co-relation 1928. Up to 110 conditions per place. [2022-11-16 10:55:13,596 INFO L137 encePairwiseOnDemand]: 341/346 looper letters, 17 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-16 10:55:13,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 321 transitions, 825 flow [2022-11-16 10:55:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:55:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 10:55:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2026 transitions. [2022-11-16 10:55:13,602 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8364987613542527 [2022-11-16 10:55:13,602 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2026 transitions. [2022-11-16 10:55:13,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2026 transitions. [2022-11-16 10:55:13,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:13,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2026 transitions. [2022-11-16 10:55:13,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 289.42857142857144) internal successors, (2026), 7 states have internal predecessors, (2026), 0 states have call successors, (0), 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-11-16 10:55:13,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 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-11-16 10:55:13,631 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 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-11-16 10:55:13,631 INFO L175 Difference]: Start difference. First operand has 319 places, 319 transitions, 777 flow. Second operand 7 states and 2026 transitions. [2022-11-16 10:55:13,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 321 transitions, 825 flow [2022-11-16 10:55:13,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 321 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:13,639 INFO L231 Difference]: Finished difference. Result has 323 places, 318 transitions, 778 flow [2022-11-16 10:55:13,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=778, PETRI_PLACES=323, PETRI_TRANSITIONS=318} [2022-11-16 10:55:13,641 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 17 predicate places. [2022-11-16 10:55:13,642 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 318 transitions, 778 flow [2022-11-16 10:55:13,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 288.6666666666667) internal successors, (1732), 6 states have internal predecessors, (1732), 0 states have call successors, (0), 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-11-16 10:55:13,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:13,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:13,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_696bd1e3-d7aa-40b7-95a6-f6a05d3813d2/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 10:55:13,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 491024885, now seen corresponding path program 1 times [2022-11-16 10:55:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283362248] [2022-11-16 10:55:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:13,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:13,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283362248] [2022-11-16 10:55:13,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283362248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:13,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:13,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:55:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431185533] [2022-11-16 10:55:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:13,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:13,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 346 [2022-11-16 10:55:13,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 318 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-16 10:55:13,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:13,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 346 [2022-11-16 10:55:13,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:20,721 INFO L130 PetriNetUnfolder]: 9389/34325 cut-off events. [2022-11-16 10:55:20,722 INFO L131 PetriNetUnfolder]: For 7419/7419 co-relation queries the response was YES. [2022-11-16 10:55:20,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53604 conditions, 34325 events. 9389/34325 cut-off events. For 7419/7419 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 473469 event pairs, 3631 based on Foata normal form. 0/30755 useless extension candidates. Maximal degree in co-relation 38123. Up to 10517 conditions per place. [2022-11-16 10:55:21,502 INFO L137 encePairwiseOnDemand]: 335/346 looper letters, 79 selfloop transitions, 17 changer transitions 0/365 dead transitions. [2022-11-16 10:55:21,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 365 transitions, 1132 flow [2022-11-16 10:55:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 10:55:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1426 transitions. [2022-11-16 10:55:21,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242774566473988 [2022-11-16 10:55:21,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1426 transitions. [2022-11-16 10:55:21,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1426 transitions. [2022-11-16 10:55:21,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1426 transitions. [2022-11-16 10:55:21,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 285.2) internal successors, (1426), 5 states have internal predecessors, (1426), 0 states have call successors, (0), 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-11-16 10:55:21,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:21,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 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-11-16 10:55:21,518 INFO L175 Difference]: Start difference. First operand has 323 places, 318 transitions, 778 flow. Second operand 5 states and 1426 transitions. [2022-11-16 10:55:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 365 transitions, 1132 flow [2022-11-16 10:55:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 365 transitions, 1121 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-16 10:55:21,562 INFO L231 Difference]: Finished difference. Result has 325 places, 324 transitions, 856 flow [2022-11-16 10:55:21,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=856, PETRI_PLACES=325, PETRI_TRANSITIONS=324} [2022-11-16 10:55:21,564 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 19 predicate places. [2022-11-16 10:55:21,564 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 324 transitions, 856 flow [2022-11-16 10:55:21,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-16 10:55:21,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:21,565 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:21,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:55:21,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash -100466130, now seen corresponding path program 1 times [2022-11-16 10:55:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820237810] [2022-11-16 10:55:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820237810] [2022-11-16 10:55:21,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820237810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:21,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:21,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744352741] [2022-11-16 10:55:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:21,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:21,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 346 [2022-11-16 10:55:21,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 324 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 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-11-16 10:55:21,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:21,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 346 [2022-11-16 10:55:21,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:32,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread2of3ForFork0InUse, 177#L963-5true, t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 258#L938-6true, 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:32,730 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-16 10:55:32,731 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-16 10:55:32,731 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 10:55:32,731 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 10:55:32,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 121#L942-6true, 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:32,816 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-16 10:55:32,817 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-16 10:55:32,817 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-16 10:55:32,817 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 10:55:32,929 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, 118#L938-13true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:32,929 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-16 10:55:32,929 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 10:55:32,929 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 10:55:32,930 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 10:55:32,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, 300#L942-13true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:32,965 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-16 10:55:32,965 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 10:55:32,965 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-16 10:55:32,965 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-16 10:55:32,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, 273#L938-16true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), 177#L963-5true, t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:32,981 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 10:55:32,982 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 10:55:32,982 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 10:55:32,982 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 10:55:33,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][378], [319#true, t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 527#true, 31#L942-16true, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:33,012 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 10:55:33,012 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 10:55:33,012 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 10:55:33,013 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-16 10:55:33,064 INFO L130 PetriNetUnfolder]: 16150/54120 cut-off events. [2022-11-16 10:55:33,064 INFO L131 PetriNetUnfolder]: For 13814/13850 co-relation queries the response was YES. [2022-11-16 10:55:33,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87939 conditions, 54120 events. 16150/54120 cut-off events. For 13814/13850 co-relation queries the response was YES. Maximal size of possible extension queue 2530. Compared 777799 event pairs, 4354 based on Foata normal form. 27/48337 useless extension candidates. Maximal degree in co-relation 75368. Up to 12768 conditions per place. [2022-11-16 10:55:33,996 INFO L137 encePairwiseOnDemand]: 328/346 looper letters, 148 selfloop transitions, 48 changer transitions 0/460 dead transitions. [2022-11-16 10:55:33,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 460 transitions, 1711 flow [2022-11-16 10:55:33,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 10:55:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2543 transitions. [2022-11-16 10:55:34,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8166345536287732 [2022-11-16 10:55:34,007 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2543 transitions. [2022-11-16 10:55:34,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2543 transitions. [2022-11-16 10:55:34,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:34,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2543 transitions. [2022-11-16 10:55:34,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 282.55555555555554) internal successors, (2543), 9 states have internal predecessors, (2543), 0 states have call successors, (0), 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-11-16 10:55:34,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 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-11-16 10:55:34,030 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 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-11-16 10:55:34,030 INFO L175 Difference]: Start difference. First operand has 325 places, 324 transitions, 856 flow. Second operand 9 states and 2543 transitions. [2022-11-16 10:55:34,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 460 transitions, 1711 flow [2022-11-16 10:55:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 460 transitions, 1700 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:34,094 INFO L231 Difference]: Finished difference. Result has 338 places, 355 transitions, 1196 flow [2022-11-16 10:55:34,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1196, PETRI_PLACES=338, PETRI_TRANSITIONS=355} [2022-11-16 10:55:34,095 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 32 predicate places. [2022-11-16 10:55:34,096 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 355 transitions, 1196 flow [2022-11-16 10:55:34,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 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-11-16 10:55:34,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:34,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:34,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 10:55:34,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1180518556, now seen corresponding path program 1 times [2022-11-16 10:55:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:34,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585726793] [2022-11-16 10:55:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585726793] [2022-11-16 10:55:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585726793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:34,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:34,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132831141] [2022-11-16 10:55:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:55:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:55:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:55:34,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 346 [2022-11-16 10:55:34,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 355 transitions, 1196 flow. Second operand has 5 states, 5 states have (on average 290.2) internal successors, (1451), 5 states have internal predecessors, (1451), 0 states have call successors, (0), 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-11-16 10:55:34,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:34,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 346 [2022-11-16 10:55:34,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:36,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][297], [319#true, Black: 540#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), Black: 546#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (<= ~global~0 1)), Black: 541#(<= ~global~0 1), Black: 542#(<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1), Black: 548#(and (<= ~global~0 1) (<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1)), t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), t_funThread2of3ForFork0NotInUse, 537#true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), 177#L963-5true, t_funThread3of3ForFork0NotInUse, 556#true, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:36,880 INFO L383 tUnfolder$Statistics]: this new event has 165 ancestors and is cut-off event [2022-11-16 10:55:36,881 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 10:55:36,881 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 10:55:36,881 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-16 10:55:37,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][297], [319#true, Black: 540#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), Black: 546#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (<= ~global~0 1)), Black: 541#(<= ~global~0 1), Black: 542#(<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1), Black: 548#(and (<= ~global~0 1) (<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1)), t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), 177#L963-5true, t_funThread3of3ForFork0NotInUse, 556#true, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), 76#t_funENTRYtrue, Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:37,169 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-16 10:55:37,169 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-16 10:55:37,169 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-16 10:55:37,169 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-16 10:55:37,245 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][297], [319#true, Black: 540#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), Black: 546#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (<= ~global~0 1)), Black: 541#(<= ~global~0 1), Black: 542#(<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1), 166#L951true, Black: 548#(and (<= ~global~0 1) (<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1)), t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0InUse, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), 177#L963-5true, t_funThread3of3ForFork0NotInUse, 556#true, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:37,245 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-16 10:55:37,245 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 10:55:37,245 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-11-16 10:55:37,246 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-16 10:55:37,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1293] t_funEXIT-->L963-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_11|} AuxVars[] AssignedVars[][246], [319#true, Black: 540#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), Black: 546#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (<= ~global~0 1)), Black: 541#(<= ~global~0 1), Black: 542#(<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1), Black: 548#(and (<= ~global~0 1) (<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1)), t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), 537#true, t_funThread2of3ForFork0NotInUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), 566#(and (<= |t_funThread1of3ForFork0_~g~0#1.offset| |#funAddr~good.offset|) (<= |t_funThread1of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| |#funAddr~good.offset|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:37,535 INFO L383 tUnfolder$Statistics]: this new event has 221 ancestors and is cut-off event [2022-11-16 10:55:37,535 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 10:55:37,535 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-16 10:55:37,535 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 10:55:37,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1294] t_funEXIT-->L963-5: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][306], [319#true, Black: 540#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), Black: 546#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (<= ~global~0 1)), Black: 541#(<= ~global~0 1), Black: 542#(<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1), Black: 548#(and (<= ~global~0 1) (<= |t_funThread1of3ForFork0_bad_#t~post34#1| 1)), t_funThread1of3ForFork0NotInUse, Black: 330#(= ~global~0 0), 537#true, Black: 331#(= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|), t_funThread2of3ForFork0NotInUse, 177#L963-5true, Black: 333#(and (= 0 |t_funThread1of3ForFork0_bad_#t~post32#1|) (= ~global~0 0)), t_funThread3of3ForFork0NotInUse, 556#true, Black: 529#(= ~global~0 0), Black: 530#(= |t_funThread1of3ForFork0_good_#t~post37#1| 0), Black: 532#(and (= ~global~0 0) (= |t_funThread1of3ForFork0_good_#t~post37#1| 0)), Black: 314#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post41#1|)), Black: 311#(= |ULTIMATE.start_main_~i~0#1| 0), 342#(<= 1 |ULTIMATE.start_main_~i~0#1|)]) [2022-11-16 10:55:37,810 INFO L383 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-11-16 10:55:37,810 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 10:55:37,810 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 10:55:37,810 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 10:55:37,825 INFO L130 PetriNetUnfolder]: 1306/14525 cut-off events. [2022-11-16 10:55:37,825 INFO L131 PetriNetUnfolder]: For 6769/7488 co-relation queries the response was YES. [2022-11-16 10:55:37,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21425 conditions, 14525 events. 1306/14525 cut-off events. For 6769/7488 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 192425 event pairs, 347 based on Foata normal form. 89/12939 useless extension candidates. Maximal degree in co-relation 18548. Up to 980 conditions per place. [2022-11-16 10:55:38,091 INFO L137 encePairwiseOnDemand]: 341/346 looper letters, 35 selfloop transitions, 7 changer transitions 0/382 dead transitions. [2022-11-16 10:55:38,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 382 transitions, 1373 flow [2022-11-16 10:55:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:55:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 10:55:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2067 transitions. [2022-11-16 10:55:38,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8534269199009084 [2022-11-16 10:55:38,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2067 transitions. [2022-11-16 10:55:38,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2067 transitions. [2022-11-16 10:55:38,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:38,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2067 transitions. [2022-11-16 10:55:38,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 295.2857142857143) internal successors, (2067), 7 states have internal predecessors, (2067), 0 states have call successors, (0), 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-11-16 10:55:38,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 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-11-16 10:55:38,112 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 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-11-16 10:55:38,113 INFO L175 Difference]: Start difference. First operand has 338 places, 355 transitions, 1196 flow. Second operand 7 states and 2067 transitions. [2022-11-16 10:55:38,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 382 transitions, 1373 flow [2022-11-16 10:55:38,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 382 transitions, 1301 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-11-16 10:55:38,147 INFO L231 Difference]: Finished difference. Result has 344 places, 360 transitions, 1163 flow [2022-11-16 10:55:38,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1163, PETRI_PLACES=344, PETRI_TRANSITIONS=360} [2022-11-16 10:55:38,149 INFO L288 CegarLoopForPetriNet]: 306 programPoint places, 38 predicate places. [2022-11-16 10:55:38,149 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 360 transitions, 1163 flow [2022-11-16 10:55:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 290.2) internal successors, (1451), 5 states have internal predecessors, (1451), 0 states have call successors, (0), 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-11-16 10:55:38,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:38,150 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:38,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 10:55:38,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-16 10:55:38,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1740761518, now seen corresponding path program 1 times [2022-11-16 10:55:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496095480] [2022-11-16 10:55:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:38,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:38,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496095480] [2022-11-16 10:55:38,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496095480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:38,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:38,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999919220] [2022-11-16 10:55:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:38,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:38,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 346 [2022-11-16 10:55:38,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 360 transitions, 1163 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 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-11-16 10:55:38,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:38,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 346 [2022-11-16 10:55:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand