./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- 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-8393723 [2022-11-18 18:43:18,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:43:18,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:43:18,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:43:18,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:43:18,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:43:18,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:43:18,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:43:18,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:43:18,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:43:18,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:43:18,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:43:18,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:43:18,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:43:18,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:43:18,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:43:18,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:43:18,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:43:18,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:43:18,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:43:18,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:43:18,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:43:18,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:43:18,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:43:18,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:43:18,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:43:18,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:43:18,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:43:18,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:43:18,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:43:18,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:43:18,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:43:18,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:43:18,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:43:18,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:43:18,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:43:18,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:43:18,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:43:18,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:43:18,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:43:18,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:43:18,379 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 18:43:18,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:43:18,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:43:18,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:43:18,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:43:18,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:43:18,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:43:18,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:43:18,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:43:18,421 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:43:18,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:43:18,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:43:18,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:43:18,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:43:18,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:43:18,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:43:18,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:43:18,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:43:18,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:43:18,424 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 18:43:18,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:43:18,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:43:18,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:43:18,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:43:18,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:43:18,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:43:18,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:43:18,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:43:18,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:43:18,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:43:18,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:43:18,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:43:18,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:43:18,427 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:43:18,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:43:18,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:43:18,428 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_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/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_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2022-11-18 18:43:18,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:43:18,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:43:18,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:43:18,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:43:18,792 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:43:18,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-18 18:43:18,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/data/79f495c99/cc7c563095d24cebb4b4f6a26e40ad4a/FLAG1a1c30b49 [2022-11-18 18:43:19,371 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:43:19,372 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-18 18:43:19,389 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/data/79f495c99/cc7c563095d24cebb4b4f6a26e40ad4a/FLAG1a1c30b49 [2022-11-18 18:43:19,718 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/data/79f495c99/cc7c563095d24cebb4b4f6a26e40ad4a [2022-11-18 18:43:19,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:43:19,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:43:19,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:43:19,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:43:19,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:43:19,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:19" (1/1) ... [2022-11-18 18:43:19,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b3fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:19, skipping insertion in model container [2022-11-18 18:43:19,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:19" (1/1) ... [2022-11-18 18:43:19,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:43:19,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:43:19,986 WARN L234 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_6ea38ac4-d854-4ab7-9781-cb3674af7a19/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-18 18:43:20,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:43:20,079 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:43:20,090 WARN L234 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_6ea38ac4-d854-4ab7-9781-cb3674af7a19/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-18 18:43:20,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:43:20,133 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:43:20,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20 WrapperNode [2022-11-18 18:43:20,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:43:20,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:43:20,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:43:20,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:43:20,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,182 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 224 [2022-11-18 18:43:20,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:43:20,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:43:20,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:43:20,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:43:20,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:43:20,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:43:20,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:43:20,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:43:20,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (1/1) ... [2022-11-18 18:43:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:43:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:43:20,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:43:20,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:43:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:43:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-18 18:43:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-18 18:43:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-18 18:43:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-18 18:43:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-18 18:43:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-18 18:43:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-18 18:43:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-18 18:43:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-18 18:43:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-18 18:43:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-18 18:43:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-18 18:43:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:43:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-18 18:43:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-18 18:43:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:43:20,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:43:20,470 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:43:20,473 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:43:20,896 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:43:20,907 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:43:20,907 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 18:43:20,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:20 BoogieIcfgContainer [2022-11-18 18:43:20,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:43:20,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:43:20,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:43:20,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:43:20,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:43:19" (1/3) ... [2022-11-18 18:43:20,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143bf210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:43:20, skipping insertion in model container [2022-11-18 18:43:20,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:20" (2/3) ... [2022-11-18 18:43:20,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143bf210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:43:20, skipping insertion in model container [2022-11-18 18:43:20,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:20" (3/3) ... [2022-11-18 18:43:20,922 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-11-18 18:43:20,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:43:20,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 18:43:21,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:43:21,027 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;@57044e7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:43:21,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 18:43:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-18 18:43:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:43:21,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:21,054 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:21,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1554820752, now seen corresponding path program 1 times [2022-11-18 18:43:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:21,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900480683] [2022-11-18 18:43:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:21,702 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-18 18:43:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900480683] [2022-11-18 18:43:21,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900480683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:21,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:21,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:43:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300492813] [2022-11-18 18:43:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:43:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:43:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:43:21,756 INFO L87 Difference]: Start difference. First operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:22,880 INFO L93 Difference]: Finished difference Result 379 states and 571 transitions. [2022-11-18 18:43:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:43:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:43:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:22,896 INFO L225 Difference]: With dead ends: 379 [2022-11-18 18:43:22,897 INFO L226 Difference]: Without dead ends: 253 [2022-11-18 18:43:22,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:43:22,905 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 319 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:22,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 480 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 18:43:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-18 18:43:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 210. [2022-11-18 18:43:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.4761904761904763) internal successors, (248), 173 states have internal predecessors, (248), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-18 18:43:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2022-11-18 18:43:22,994 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 55 [2022-11-18 18:43:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:22,995 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2022-11-18 18:43:22,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2022-11-18 18:43:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:43:22,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:22,998 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:23,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:43:23,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -275712372, now seen corresponding path program 1 times [2022-11-18 18:43:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:23,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638107094] [2022-11-18 18:43:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:23,270 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-18 18:43:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638107094] [2022-11-18 18:43:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638107094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:23,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238145996] [2022-11-18 18:43:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:23,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:23,275 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:24,273 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2022-11-18 18:43:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 18:43:24,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:43:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:24,278 INFO L225 Difference]: With dead ends: 570 [2022-11-18 18:43:24,279 INFO L226 Difference]: Without dead ends: 369 [2022-11-18 18:43:24,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:43:24,283 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 300 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:24,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 777 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 18:43:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-18 18:43:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2022-11-18 18:43:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 250 states have internal predecessors, (358), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-18 18:43:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2022-11-18 18:43:24,331 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 55 [2022-11-18 18:43:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:24,331 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2022-11-18 18:43:24,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2022-11-18 18:43:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:43:24,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:24,335 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:43:24,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1173105650, now seen corresponding path program 1 times [2022-11-18 18:43:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058044659] [2022-11-18 18:43:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:24,526 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-18 18:43:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058044659] [2022-11-18 18:43:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058044659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:24,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:24,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969109409] [2022-11-18 18:43:24,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:24,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:24,535 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:25,558 INFO L93 Difference]: Finished difference Result 930 states and 1330 transitions. [2022-11-18 18:43:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:43:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:43:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:25,564 INFO L225 Difference]: With dead ends: 930 [2022-11-18 18:43:25,565 INFO L226 Difference]: Without dead ends: 636 [2022-11-18 18:43:25,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:43:25,568 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 355 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:25,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 765 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 18:43:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-18 18:43:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 482. [2022-11-18 18:43:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 391 states have (on average 1.4552429667519182) internal successors, (569), 399 states have internal predecessors, (569), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-18 18:43:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2022-11-18 18:43:25,676 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 55 [2022-11-18 18:43:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:25,676 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2022-11-18 18:43:25,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2022-11-18 18:43:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:43:25,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:25,691 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:25,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:43:25,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -924959156, now seen corresponding path program 1 times [2022-11-18 18:43:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:25,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666205381] [2022-11-18 18:43:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:25,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-18 18:43:25,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:25,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666205381] [2022-11-18 18:43:25,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666205381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:25,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:25,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143034404] [2022-11-18 18:43:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:25,927 INFO L87 Difference]: Start difference. First operand 482 states and 688 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:26,891 INFO L93 Difference]: Finished difference Result 1494 states and 2133 transitions. [2022-11-18 18:43:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:43:26,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:43:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:26,898 INFO L225 Difference]: With dead ends: 1494 [2022-11-18 18:43:26,899 INFO L226 Difference]: Without dead ends: 1021 [2022-11-18 18:43:26,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:43:26,903 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 295 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:26,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 739 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 18:43:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-18 18:43:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 783. [2022-11-18 18:43:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 634 states have (on average 1.4369085173501577) internal successors, (911), 646 states have internal predecessors, (911), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-18 18:43:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1116 transitions. [2022-11-18 18:43:26,998 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1116 transitions. Word has length 55 [2022-11-18 18:43:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:26,998 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1116 transitions. [2022-11-18 18:43:26,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1116 transitions. [2022-11-18 18:43:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:43:27,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:27,001 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:27,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:43:27,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -501312434, now seen corresponding path program 1 times [2022-11-18 18:43:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:27,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200909433] [2022-11-18 18:43:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:27,092 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-18 18:43:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200909433] [2022-11-18 18:43:27,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200909433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:27,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:27,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:43:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823865686] [2022-11-18 18:43:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:27,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:43:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:43:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:43:27,095 INFO L87 Difference]: Start difference. First operand 783 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:27,874 INFO L93 Difference]: Finished difference Result 2167 states and 3093 transitions. [2022-11-18 18:43:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:43:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:43:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:27,883 INFO L225 Difference]: With dead ends: 2167 [2022-11-18 18:43:27,883 INFO L226 Difference]: Without dead ends: 1394 [2022-11-18 18:43:27,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:43:27,899 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:27,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 522 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:43:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-18 18:43:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1187. [2022-11-18 18:43:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 955 states have (on average 1.4094240837696335) internal successors, (1346), 976 states have internal predecessors, (1346), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:43:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1659 transitions. [2022-11-18 18:43:28,032 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1659 transitions. Word has length 55 [2022-11-18 18:43:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:28,032 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1659 transitions. [2022-11-18 18:43:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1659 transitions. [2022-11-18 18:43:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:28,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:28,037 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:28,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:43:28,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash 777880458, now seen corresponding path program 1 times [2022-11-18 18:43:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:28,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394011419] [2022-11-18 18:43:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:28,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:28,254 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-18 18:43:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:28,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394011419] [2022-11-18 18:43:28,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394011419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:28,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:28,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942809612] [2022-11-18 18:43:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:28,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:28,259 INFO L87 Difference]: Start difference. First operand 1187 states and 1659 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:28,919 INFO L93 Difference]: Finished difference Result 2581 states and 3659 transitions. [2022-11-18 18:43:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:43:28,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:28,929 INFO L225 Difference]: With dead ends: 2581 [2022-11-18 18:43:28,929 INFO L226 Difference]: Without dead ends: 1404 [2022-11-18 18:43:28,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:43:28,941 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 170 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:28,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 530 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:43:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-11-18 18:43:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1202. [2022-11-18 18:43:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 970 states have (on average 1.3938144329896907) internal successors, (1352), 991 states have internal predecessors, (1352), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:43:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1665 transitions. [2022-11-18 18:43:29,086 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1665 transitions. Word has length 56 [2022-11-18 18:43:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:29,088 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1665 transitions. [2022-11-18 18:43:29,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1665 transitions. [2022-11-18 18:43:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:29,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:29,092 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:29,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:43:29,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 705493900, now seen corresponding path program 1 times [2022-11-18 18:43:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:29,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498440185] [2022-11-18 18:43:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:29,267 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-18 18:43:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:29,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498440185] [2022-11-18 18:43:29,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498440185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:29,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:29,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182653817] [2022-11-18 18:43:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:29,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:29,274 INFO L87 Difference]: Start difference. First operand 1202 states and 1665 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:29,967 INFO L93 Difference]: Finished difference Result 2636 states and 3704 transitions. [2022-11-18 18:43:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:43:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:29,976 INFO L225 Difference]: With dead ends: 2636 [2022-11-18 18:43:29,976 INFO L226 Difference]: Without dead ends: 1444 [2022-11-18 18:43:29,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:43:29,980 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 135 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 525 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:43:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-11-18 18:43:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1244. [2022-11-18 18:43:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1012 states have (on average 1.3774703557312253) internal successors, (1394), 1033 states have internal predecessors, (1394), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:43:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1707 transitions. [2022-11-18 18:43:30,101 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1707 transitions. Word has length 56 [2022-11-18 18:43:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:30,102 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1707 transitions. [2022-11-18 18:43:30,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1707 transitions. [2022-11-18 18:43:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:30,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:30,103 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:30,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:43:30,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1666245362, now seen corresponding path program 1 times [2022-11-18 18:43:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134554443] [2022-11-18 18:43:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:30,252 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-18 18:43:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:30,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134554443] [2022-11-18 18:43:30,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134554443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:30,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:43:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759112115] [2022-11-18 18:43:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:30,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:43:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:30,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:43:30,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:43:30,254 INFO L87 Difference]: Start difference. First operand 1244 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:31,110 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-11-18 18:43:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:43:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:31,116 INFO L225 Difference]: With dead ends: 1802 [2022-11-18 18:43:31,116 INFO L226 Difference]: Without dead ends: 1068 [2022-11-18 18:43:31,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-18 18:43:31,120 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 372 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:31,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 585 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:43:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-18 18:43:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2022-11-18 18:43:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3662551440329218) internal successors, (996), 743 states have internal predecessors, (996), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-11-18 18:43:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1211 transitions. [2022-11-18 18:43:31,233 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1211 transitions. Word has length 56 [2022-11-18 18:43:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:31,234 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1211 transitions. [2022-11-18 18:43:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1211 transitions. [2022-11-18 18:43:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:31,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:31,235 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:43:31,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1447390644, now seen corresponding path program 1 times [2022-11-18 18:43:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:31,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728806056] [2022-11-18 18:43:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:31,378 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-18 18:43:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:31,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728806056] [2022-11-18 18:43:31,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728806056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:31,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:31,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:43:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561679282] [2022-11-18 18:43:31,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:31,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:43:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:43:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:43:31,380 INFO L87 Difference]: Start difference. First operand 898 states and 1211 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:32,324 INFO L93 Difference]: Finished difference Result 1745 states and 2359 transitions. [2022-11-18 18:43:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:43:32,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:32,335 INFO L225 Difference]: With dead ends: 1745 [2022-11-18 18:43:32,335 INFO L226 Difference]: Without dead ends: 1096 [2022-11-18 18:43:32,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:43:32,341 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 369 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:32,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 580 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:43:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-11-18 18:43:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2022-11-18 18:43:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3613793103448275) internal successors, (987), 737 states have internal predecessors, (987), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-11-18 18:43:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2022-11-18 18:43:32,444 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 56 [2022-11-18 18:43:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:32,444 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2022-11-18 18:43:32,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2022-11-18 18:43:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:32,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:32,445 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:32,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:43:32,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1024688818, now seen corresponding path program 1 times [2022-11-18 18:43:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:32,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805824473] [2022-11-18 18:43:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:32,638 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-18 18:43:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805824473] [2022-11-18 18:43:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805824473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:43:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142501315] [2022-11-18 18:43:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:43:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:43:32,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:43:32,640 INFO L87 Difference]: Start difference. First operand 892 states and 1194 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:33,372 INFO L93 Difference]: Finished difference Result 1689 states and 2257 transitions. [2022-11-18 18:43:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:43:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:33,384 INFO L225 Difference]: With dead ends: 1689 [2022-11-18 18:43:33,384 INFO L226 Difference]: Without dead ends: 952 [2022-11-18 18:43:33,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-18 18:43:33,387 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 409 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:33,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 537 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:43:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-11-18 18:43:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 780. [2022-11-18 18:43:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 638 states have (on average 1.3573667711598747) internal successors, (866), 648 states have internal predecessors, (866), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-11-18 18:43:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2022-11-18 18:43:33,477 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 56 [2022-11-18 18:43:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2022-11-18 18:43:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2022-11-18 18:43:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:43:33,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:33,479 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:33,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:43:33,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1842337268, now seen corresponding path program 1 times [2022-11-18 18:43:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:33,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633952411] [2022-11-18 18:43:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:33,579 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-18 18:43:33,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633952411] [2022-11-18 18:43:33,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633952411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:33,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:43:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929590517] [2022-11-18 18:43:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:33,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:43:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:33,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:43:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:43:33,582 INFO L87 Difference]: Start difference. First operand 780 states and 1038 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:34,198 INFO L93 Difference]: Finished difference Result 2410 states and 3254 transitions. [2022-11-18 18:43:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:43:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:43:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:34,208 INFO L225 Difference]: With dead ends: 2410 [2022-11-18 18:43:34,208 INFO L226 Difference]: Without dead ends: 1641 [2022-11-18 18:43:34,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:43:34,212 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 418 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:34,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 338 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:43:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-11-18 18:43:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1467. [2022-11-18 18:43:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1197 states have (on average 1.3350041771094403) internal successors, (1598), 1214 states have internal predecessors, (1598), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-11-18 18:43:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1957 transitions. [2022-11-18 18:43:34,374 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1957 transitions. Word has length 56 [2022-11-18 18:43:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:34,375 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1957 transitions. [2022-11-18 18:43:34,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:43:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1957 transitions. [2022-11-18 18:43:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 18:43:34,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:34,377 INFO L195 NwaCegarLoop]: 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] [2022-11-18 18:43:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:43:34,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1987017488, now seen corresponding path program 1 times [2022-11-18 18:43:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:34,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017053566] [2022-11-18 18:43:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:34,438 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-18 18:43:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:34,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017053566] [2022-11-18 18:43:34,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017053566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:34,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:34,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:43:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890060077] [2022-11-18 18:43:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:43:34,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:43:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:43:34,441 INFO L87 Difference]: Start difference. First operand 1467 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 18:43:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:35,049 INFO L93 Difference]: Finished difference Result 4191 states and 5620 transitions. [2022-11-18 18:43:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:43:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-11-18 18:43:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:35,063 INFO L225 Difference]: With dead ends: 4191 [2022-11-18 18:43:35,063 INFO L226 Difference]: Without dead ends: 2738 [2022-11-18 18:43:35,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:43:35,069 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 329 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:35,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 386 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:43:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-11-18 18:43:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2392. [2022-11-18 18:43:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1948 states have (on average 1.320328542094456) internal successors, (2572), 1975 states have internal predecessors, (2572), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-11-18 18:43:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3160 transitions. [2022-11-18 18:43:35,349 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3160 transitions. Word has length 57 [2022-11-18 18:43:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:35,349 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3160 transitions. [2022-11-18 18:43:35,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 18:43:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3160 transitions. [2022-11-18 18:43:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-18 18:43:35,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:35,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:43:35,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:43:35,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:35,353 INFO L85 PathProgramCache]: Analyzing trace with hash 772242277, now seen corresponding path program 1 times [2022-11-18 18:43:35,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:35,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779108482] [2022-11-18 18:43:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 18:43:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:43:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:35,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779108482] [2022-11-18 18:43:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779108482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:35,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:35,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:43:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387842132] [2022-11-18 18:43:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:35,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:43:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:43:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:43:35,471 INFO L87 Difference]: Start difference. First operand 2392 states and 3160 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:43:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:36,829 INFO L93 Difference]: Finished difference Result 7577 states and 10103 transitions. [2022-11-18 18:43:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:43:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-11-18 18:43:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:36,856 INFO L225 Difference]: With dead ends: 7577 [2022-11-18 18:43:36,856 INFO L226 Difference]: Without dead ends: 5201 [2022-11-18 18:43:36,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:43:36,865 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 739 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:36,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 529 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 18:43:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-18 18:43:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4675. [2022-11-18 18:43:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4675 states, 3792 states have (on average 1.298259493670886) internal successors, (4923), 3861 states have internal predecessors, (4923), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-11-18 18:43:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6197 transitions. [2022-11-18 18:43:37,421 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6197 transitions. Word has length 74 [2022-11-18 18:43:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:37,422 INFO L495 AbstractCegarLoop]: Abstraction has 4675 states and 6197 transitions. [2022-11-18 18:43:37,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:43:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6197 transitions. [2022-11-18 18:43:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 18:43:37,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:37,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 18:43:37,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:43:37,426 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 237737077, now seen corresponding path program 1 times [2022-11-18 18:43:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:37,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555019076] [2022-11-18 18:43:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:43:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:43:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 18:43:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 18:43:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555019076] [2022-11-18 18:43:37,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555019076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:37,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:37,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814837346] [2022-11-18 18:43:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:37,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:37,755 INFO L87 Difference]: Start difference. First operand 4675 states and 6197 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:43:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:38,828 INFO L93 Difference]: Finished difference Result 8997 states and 11865 transitions. [2022-11-18 18:43:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:43:38,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-18 18:43:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:38,855 INFO L225 Difference]: With dead ends: 8997 [2022-11-18 18:43:38,855 INFO L226 Difference]: Without dead ends: 5271 [2022-11-18 18:43:38,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-18 18:43:38,866 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 505 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:38,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 423 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:43:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-11-18 18:43:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4643. [2022-11-18 18:43:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3756 states have (on average 1.286741214057508) internal successors, (4833), 3829 states have internal predecessors, (4833), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-11-18 18:43:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6026 transitions. [2022-11-18 18:43:39,424 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6026 transitions. Word has length 90 [2022-11-18 18:43:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:39,425 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6026 transitions. [2022-11-18 18:43:39,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:43:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6026 transitions. [2022-11-18 18:43:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 18:43:39,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:39,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-18 18:43:39,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:43:39,430 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1804495027, now seen corresponding path program 1 times [2022-11-18 18:43:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:39,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550524562] [2022-11-18 18:43:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:43:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:43:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 18:43:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 18:43:39,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550524562] [2022-11-18 18:43:39,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550524562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:39,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:39,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:43:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742008104] [2022-11-18 18:43:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:43:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:43:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:43:39,505 INFO L87 Difference]: Start difference. First operand 4643 states and 6026 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 18:43:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:40,146 INFO L93 Difference]: Finished difference Result 5107 states and 6643 transitions. [2022-11-18 18:43:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:43:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-18 18:43:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:40,168 INFO L225 Difference]: With dead ends: 5107 [2022-11-18 18:43:40,168 INFO L226 Difference]: Without dead ends: 4196 [2022-11-18 18:43:40,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:43:40,174 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 274 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:40,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 238 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:43:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2022-11-18 18:43:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 3734. [2022-11-18 18:43:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.2913776015857283) internal successors, (3909), 3088 states have internal predecessors, (3909), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-11-18 18:43:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4861 transitions. [2022-11-18 18:43:40,671 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4861 transitions. Word has length 90 [2022-11-18 18:43:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:40,671 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4861 transitions. [2022-11-18 18:43:40,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 18:43:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4861 transitions. [2022-11-18 18:43:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 18:43:40,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:40,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 18:43:40,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:43:40,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:40,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1432721063, now seen corresponding path program 1 times [2022-11-18 18:43:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:40,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121185801] [2022-11-18 18:43:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:43:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:43:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:43:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:43:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:43:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:43:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:43:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 18:43:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:43:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 18:43:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:43:40,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121185801] [2022-11-18 18:43:40,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121185801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:43:40,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:43:40,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:43:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423799273] [2022-11-18 18:43:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:43:40,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:43:40,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:43:40,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:43:40,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:43:40,821 INFO L87 Difference]: Start difference. First operand 3734 states and 4861 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:43:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:43:42,366 INFO L93 Difference]: Finished difference Result 7161 states and 9288 transitions. [2022-11-18 18:43:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 18:43:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-18 18:43:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:43:42,395 INFO L225 Difference]: With dead ends: 7161 [2022-11-18 18:43:42,395 INFO L226 Difference]: Without dead ends: 4113 [2022-11-18 18:43:42,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-18 18:43:42,404 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 1052 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 18:43:42,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 610 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 18:43:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-11-18 18:43:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3734. [2022-11-18 18:43:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.276841757515692) internal successors, (3865), 3088 states have internal predecessors, (3865), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-18 18:43:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4751 transitions. [2022-11-18 18:43:42,807 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4751 transitions. Word has length 91 [2022-11-18 18:43:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:43:42,807 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4751 transitions. [2022-11-18 18:43:42,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:43:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4751 transitions. [2022-11-18 18:43:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 18:43:42,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:43:42,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:43:42,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 18:43:42,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:43:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:43:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 578901004, now seen corresponding path program 1 times [2022-11-18 18:43:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:43:42,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721956150] [2022-11-18 18:43:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:43:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:43:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:43:42,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:43:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:43:42,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:43:42,885 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:43:42,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-18 18:43:42,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-18 18:43:42,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-18 18:43:42,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-18 18:43:42,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 18:43:42,896 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:43:42,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:43:43,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:43:43 BoogieIcfgContainer [2022-11-18 18:43:43,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:43:43,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:43:43,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:43:43,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:43:43,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:20" (3/4) ... [2022-11-18 18:43:43,026 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:43:43,127 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:43:43,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:43:43,128 INFO L158 Benchmark]: Toolchain (without parser) took 23405.80ms. Allocated memory was 125.8MB in the beginning and 629.1MB in the end (delta: 503.3MB). Free memory was 89.4MB in the beginning and 285.3MB in the end (delta: -196.0MB). Peak memory consumption was 307.4MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,129 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory was 96.5MB in the beginning and 96.5MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:43:43,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.84ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 98.2MB in the end (delta: -9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.32ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,132 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 125.8MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,133 INFO L158 Benchmark]: RCFGBuilder took 688.58ms. Allocated memory is still 125.8MB. Free memory was 94.0MB in the beginning and 75.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,134 INFO L158 Benchmark]: TraceAbstraction took 22109.37ms. Allocated memory was 125.8MB in the beginning and 629.1MB in the end (delta: 503.3MB). Free memory was 75.1MB in the beginning and 292.7MB in the end (delta: -217.5MB). Peak memory consumption was 287.2MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,134 INFO L158 Benchmark]: Witness Printer took 104.41ms. Allocated memory is still 629.1MB. Free memory was 292.7MB in the beginning and 285.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 18:43:43,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory was 96.5MB in the beginning and 96.5MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.84ms. Allocated memory is still 125.8MB. Free memory was 89.1MB in the beginning and 98.2MB in the end (delta: -9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.32ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 125.8MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.58ms. Allocated memory is still 125.8MB. Free memory was 94.0MB in the beginning and 75.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22109.37ms. Allocated memory was 125.8MB in the beginning and 629.1MB in the end (delta: 503.3MB). Free memory was 75.1MB in the beginning and 292.7MB in the end (delta: -217.5MB). Peak memory consumption was 287.2MB. Max. memory is 16.1GB. * Witness Printer took 104.41ms. Allocated memory is still 629.1MB. Free memory was 292.7MB in the beginning and 285.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m_st ; [L29] int t1_i ; [L30] int M_E = 2; [L32] int E_M = 2; [L31] int T1_E = 2; [L28] int m_i ; [L33] int E_1 = 2; [L24] int m_pc = 0; [L27] int t1_st ; [L39] int local ; [L25] int t1_pc = 0; [L37] int token ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 121 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6607 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6457 mSDsluCounter, 8564 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6307 mSDsCounter, 1303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7877 IncrementalHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1303 mSolverCounterUnsat, 2257 mSDtfsCounter, 7877 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 4171 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 92/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 18:43:43,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ea38ac4-d854-4ab7-9781-cb3674af7a19/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)