./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:42:51,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:42:51,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:42:51,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:42:51,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:42:51,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:42:51,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:42:51,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:42:51,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:42:51,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:42:51,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:42:51,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:42:51,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:42:51,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:42:51,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:42:51,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:42:51,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:42:51,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:42:51,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:42:51,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:42:51,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:42:51,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:42:51,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:42:51,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:42:51,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:42:51,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:42:51,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:42:51,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:42:51,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:42:51,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:42:51,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:42:51,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:42:51,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:42:51,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:42:51,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:42:51,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:42:51,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:42:51,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:42:51,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:42:51,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:42:51,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:42:51,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 17:42:51,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:42:51,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:42:51,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:42:51,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:42:51,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:42:51,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:42:51,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:42:51,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:42:51,391 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:42:51,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:42:51,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:42:51,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:42:51,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:42:51,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:42:51,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:42:51,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:42:51,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:42:51,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:42:51,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:42:51,396 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:42:51,396 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2022-12-13 17:42:51,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:42:51,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:42:51,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:42:51,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:42:51,588 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:42:51,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-12-13 17:42:54,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:42:54,389 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:42:54,390 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-12-13 17:42:54,398 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/data/40100e0d9/e34c1461cedb4b1abe5b025fa76ced96/FLAG47be371da [2022-12-13 17:42:54,410 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/data/40100e0d9/e34c1461cedb4b1abe5b025fa76ced96 [2022-12-13 17:42:54,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:42:54,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:42:54,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:42:54,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:42:54,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:42:54,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2133b0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54, skipping insertion in model container [2022-12-13 17:42:54,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:42:54,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:42:54,540 WARN L237 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_668bc5d3-1eda-4bd5-8898-e56be01fefd8/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-12-13 17:42:54,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:42:54,586 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:42:54,595 WARN L237 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_668bc5d3-1eda-4bd5-8898-e56be01fefd8/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-12-13 17:42:54,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:42:54,624 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:42:54,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54 WrapperNode [2022-12-13 17:42:54,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:42:54,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:42:54,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:42:54,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:42:54,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,653 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-12-13 17:42:54,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:42:54,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:42:54,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:42:54,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:42:54,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:42:54,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:42:54,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:42:54,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:42:54,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (1/1) ... [2022-12-13 17:42:54,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:42:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:54,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:54,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:42:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:42:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 17:42:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 17:42:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 17:42:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 17:42:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 17:42:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 17:42:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 17:42:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 17:42:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 17:42:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 17:42:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:42:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 17:42:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 17:42:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:42:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:42:54,800 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:42:54,801 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:42:55,076 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:42:55,083 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:42:55,083 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 17:42:55,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:42:55 BoogieIcfgContainer [2022-12-13 17:42:55,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:42:55,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:42:55,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:42:55,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:42:55,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:42:54" (1/3) ... [2022-12-13 17:42:55,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b30cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:42:55, skipping insertion in model container [2022-12-13 17:42:55,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:42:54" (2/3) ... [2022-12-13 17:42:55,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b30cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:42:55, skipping insertion in model container [2022-12-13 17:42:55,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:42:55" (3/3) ... [2022-12-13 17:42:55,092 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2022-12-13 17:42:55,114 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:42:55,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 17:42:55,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:42:55,166 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;@15700484, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:42:55,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 17:42:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 119 states have internal predecessors, (178), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 17:42:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:55,177 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:55,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:55,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -371961680, now seen corresponding path program 1 times [2022-12-13 17:42:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:55,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872715033] [2022-12-13 17:42:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872715033] [2022-12-13 17:42:55,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872715033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:55,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:42:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016227346] [2022-12-13 17:42:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:55,451 INFO L87 Difference]: Start difference. First operand has 141 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 119 states have internal predecessors, (178), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:42:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:55,868 INFO L93 Difference]: Finished difference Result 307 states and 466 transitions. [2022-12-13 17:42:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:42:55,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 17:42:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:55,877 INFO L225 Difference]: With dead ends: 307 [2022-12-13 17:42:55,877 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 17:42:55,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:42:55,882 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 297 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:55,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 291 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:42:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 17:42:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2022-12-13 17:42:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 113 states have internal predecessors, (160), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 17:42:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2022-12-13 17:42:55,921 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 66 [2022-12-13 17:42:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:55,922 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2022-12-13 17:42:55,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:42:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2022-12-13 17:42:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:55,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:55,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:55,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:42:55,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -932661458, now seen corresponding path program 1 times [2022-12-13 17:42:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:55,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463655691] [2022-12-13 17:42:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463655691] [2022-12-13 17:42:56,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463655691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:56,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:56,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:42:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79726218] [2022-12-13 17:42:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:56,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:42:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:42:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:42:56,074 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-12-13 17:42:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:56,640 INFO L93 Difference]: Finished difference Result 447 states and 655 transitions. [2022-12-13 17:42:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:42:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 66 [2022-12-13 17:42:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:56,642 INFO L225 Difference]: With dead ends: 447 [2022-12-13 17:42:56,642 INFO L226 Difference]: Without dead ends: 322 [2022-12-13 17:42:56,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:42:56,644 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 419 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:56,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 482 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:42:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-12-13 17:42:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 255. [2022-12-13 17:42:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 209 states have (on average 1.507177033492823) internal successors, (315), 216 states have internal predecessors, (315), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-12-13 17:42:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 372 transitions. [2022-12-13 17:42:56,667 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 372 transitions. Word has length 66 [2022-12-13 17:42:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 372 transitions. [2022-12-13 17:42:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-12-13 17:42:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 372 transitions. [2022-12-13 17:42:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:56,669 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:56,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:56,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:42:56,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -190655958, now seen corresponding path program 1 times [2022-12-13 17:42:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:56,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502505214] [2022-12-13 17:42:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:56,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502505214] [2022-12-13 17:42:56,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502505214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:56,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:56,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:42:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699941502] [2022-12-13 17:42:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:56,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:42:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:56,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:42:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:42:56,799 INFO L87 Difference]: Start difference. First operand 255 states and 372 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:57,499 INFO L93 Difference]: Finished difference Result 718 states and 1057 transitions. [2022-12-13 17:42:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:42:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2022-12-13 17:42:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:57,502 INFO L225 Difference]: With dead ends: 718 [2022-12-13 17:42:57,502 INFO L226 Difference]: Without dead ends: 473 [2022-12-13 17:42:57,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:42:57,504 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 414 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:57,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 871 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:42:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-12-13 17:42:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 368. [2022-12-13 17:42:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 304 states have (on average 1.5) internal successors, (456), 312 states have internal predecessors, (456), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 17:42:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 537 transitions. [2022-12-13 17:42:57,530 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 537 transitions. Word has length 66 [2022-12-13 17:42:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:57,531 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 537 transitions. [2022-12-13 17:42:57,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 537 transitions. [2022-12-13 17:42:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:57,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:57,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:57,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:42:57,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash 253244716, now seen corresponding path program 1 times [2022-12-13 17:42:57,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:57,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881651846] [2022-12-13 17:42:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:57,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881651846] [2022-12-13 17:42:57,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881651846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:57,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:57,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:42:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873848580] [2022-12-13 17:42:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:57,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:42:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:42:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:42:57,636 INFO L87 Difference]: Start difference. First operand 368 states and 537 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:58,262 INFO L93 Difference]: Finished difference Result 1116 states and 1648 transitions. [2022-12-13 17:42:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:42:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2022-12-13 17:42:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:58,266 INFO L225 Difference]: With dead ends: 1116 [2022-12-13 17:42:58,267 INFO L226 Difference]: Without dead ends: 758 [2022-12-13 17:42:58,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:42:58,269 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 452 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:58,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 595 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:42:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-12-13 17:42:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 595. [2022-12-13 17:42:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 495 states have (on average 1.492929292929293) internal successors, (739), 505 states have internal predecessors, (739), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 17:42:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 872 transitions. [2022-12-13 17:42:58,327 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 872 transitions. Word has length 66 [2022-12-13 17:42:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:58,327 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 872 transitions. [2022-12-13 17:42:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2022-12-13 17:42:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:58,329 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:58,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:58,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:42:58,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1791584746, now seen corresponding path program 1 times [2022-12-13 17:42:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108783786] [2022-12-13 17:42:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108783786] [2022-12-13 17:42:58,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108783786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:58,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:42:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559314565] [2022-12-13 17:42:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:42:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:42:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:42:58,433 INFO L87 Difference]: Start difference. First operand 595 states and 872 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:59,136 INFO L93 Difference]: Finished difference Result 1984 states and 2933 transitions. [2022-12-13 17:42:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:42:59,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2022-12-13 17:42:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:59,143 INFO L225 Difference]: With dead ends: 1984 [2022-12-13 17:42:59,144 INFO L226 Difference]: Without dead ends: 1399 [2022-12-13 17:42:59,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:42:59,147 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 424 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:59,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 855 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:42:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-12-13 17:42:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1015. [2022-12-13 17:42:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 847 states have (on average 1.4911452184179457) internal successors, (1263), 861 states have internal predecessors, (1263), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-12-13 17:42:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1498 transitions. [2022-12-13 17:42:59,226 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1498 transitions. Word has length 66 [2022-12-13 17:42:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:59,227 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1498 transitions. [2022-12-13 17:42:59,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:42:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1498 transitions. [2022-12-13 17:42:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:42:59,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:59,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:42:59,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:42:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1310504488, now seen corresponding path program 1 times [2022-12-13 17:42:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:59,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749033674] [2022-12-13 17:42:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:42:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:42:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:42:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:42:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:59,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749033674] [2022-12-13 17:42:59,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749033674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:59,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:59,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:42:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045112503] [2022-12-13 17:42:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:59,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:42:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:42:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:42:59,318 INFO L87 Difference]: Start difference. First operand 1015 states and 1498 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:43:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:00,152 INFO L93 Difference]: Finished difference Result 3406 states and 5045 transitions. [2022-12-13 17:43:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:43:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2022-12-13 17:43:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:00,159 INFO L225 Difference]: With dead ends: 3406 [2022-12-13 17:43:00,159 INFO L226 Difference]: Without dead ends: 2401 [2022-12-13 17:43:00,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:43:00,162 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 426 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:00,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 859 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:43:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-12-13 17:43:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1868. [2022-12-13 17:43:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1568 states have (on average 1.4853316326530612) internal successors, (2329), 1590 states have internal predecessors, (2329), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 17:43:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2778 transitions. [2022-12-13 17:43:00,257 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2778 transitions. Word has length 66 [2022-12-13 17:43:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:00,257 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2778 transitions. [2022-12-13 17:43:00,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 17:43:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2778 transitions. [2022-12-13 17:43:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:43:00,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:00,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:00,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:43:00,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1294985770, now seen corresponding path program 1 times [2022-12-13 17:43:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:00,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352060191] [2022-12-13 17:43:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:00,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:00,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352060191] [2022-12-13 17:43:00,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352060191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:00,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:00,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:43:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067310060] [2022-12-13 17:43:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:00,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:43:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:43:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:00,326 INFO L87 Difference]: Start difference. First operand 1868 states and 2778 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-12-13 17:43:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:00,947 INFO L93 Difference]: Finished difference Result 5271 states and 7867 transitions. [2022-12-13 17:43:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:43:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 66 [2022-12-13 17:43:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:00,961 INFO L225 Difference]: With dead ends: 5271 [2022-12-13 17:43:00,961 INFO L226 Difference]: Without dead ends: 3414 [2022-12-13 17:43:00,967 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-12-13 17:43:00,968 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 559 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:00,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 635 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2022-12-13 17:43:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2823. [2022-12-13 17:43:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2365 states have (on average 1.46892177589852) internal successors, (3474), 2404 states have internal predecessors, (3474), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 17:43:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4143 transitions. [2022-12-13 17:43:01,145 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4143 transitions. Word has length 66 [2022-12-13 17:43:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:01,145 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 4143 transitions. [2022-12-13 17:43:01,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-12-13 17:43:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4143 transitions. [2022-12-13 17:43:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:01,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:01,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:01,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:43:01,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2126026312, now seen corresponding path program 1 times [2022-12-13 17:43:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:01,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706539918] [2022-12-13 17:43:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706539918] [2022-12-13 17:43:01,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706539918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:01,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:01,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:43:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858613933] [2022-12-13 17:43:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:01,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:43:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:01,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:43:01,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:43:01,259 INFO L87 Difference]: Start difference. First operand 2823 states and 4143 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-12-13 17:43:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:02,050 INFO L93 Difference]: Finished difference Result 6427 states and 9540 transitions. [2022-12-13 17:43:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:43:02,050 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), 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 67 [2022-12-13 17:43:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:02,061 INFO L225 Difference]: With dead ends: 6427 [2022-12-13 17:43:02,061 INFO L226 Difference]: Without dead ends: 3615 [2022-12-13 17:43:02,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:43:02,066 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 267 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:02,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 597 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2022-12-13 17:43:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2850. [2022-12-13 17:43:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2392 states have (on average 1.4565217391304348) internal successors, (3484), 2431 states have internal predecessors, (3484), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 17:43:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4153 transitions. [2022-12-13 17:43:02,237 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4153 transitions. Word has length 67 [2022-12-13 17:43:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:02,237 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 4153 transitions. [2022-12-13 17:43:02,238 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), 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-12-13 17:43:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4153 transitions. [2022-12-13 17:43:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:02,239 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:02,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:43:02,239 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1745294262, now seen corresponding path program 1 times [2022-12-13 17:43:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073399695] [2022-12-13 17:43:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:02,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073399695] [2022-12-13 17:43:02,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073399695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:02,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:02,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:43:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500372840] [2022-12-13 17:43:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:02,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:43:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:43:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:43:02,328 INFO L87 Difference]: Start difference. First operand 2850 states and 4153 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-12-13 17:43:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:02,990 INFO L93 Difference]: Finished difference Result 6717 states and 9903 transitions. [2022-12-13 17:43:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:43:02,991 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), 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 67 [2022-12-13 17:43:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:03,001 INFO L225 Difference]: With dead ends: 6717 [2022-12-13 17:43:03,001 INFO L226 Difference]: Without dead ends: 3878 [2022-12-13 17:43:03,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:43:03,013 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 267 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:03,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 597 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:43:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-12-13 17:43:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2928. [2022-12-13 17:43:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2470 states have (on average 1.4421052631578948) internal successors, (3562), 2509 states have internal predecessors, (3562), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 17:43:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 4231 transitions. [2022-12-13 17:43:03,178 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 4231 transitions. Word has length 67 [2022-12-13 17:43:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:03,179 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 4231 transitions. [2022-12-13 17:43:03,179 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), 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-12-13 17:43:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 4231 transitions. [2022-12-13 17:43:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:03,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:03,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:43:03,181 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1705667532, now seen corresponding path program 1 times [2022-12-13 17:43:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310899432] [2022-12-13 17:43:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310899432] [2022-12-13 17:43:03,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310899432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:03,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:03,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:43:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059502293] [2022-12-13 17:43:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:03,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:43:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:43:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:43:03,268 INFO L87 Difference]: Start difference. First operand 2928 states and 4231 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-12-13 17:43:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:04,714 INFO L93 Difference]: Finished difference Result 10541 states and 15513 transitions. [2022-12-13 17:43:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:04,715 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), 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 67 [2022-12-13 17:43:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:04,734 INFO L225 Difference]: With dead ends: 10541 [2022-12-13 17:43:04,734 INFO L226 Difference]: Without dead ends: 7624 [2022-12-13 17:43:04,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:43:04,740 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 947 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:04,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 744 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:43:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2022-12-13 17:43:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 6518. [2022-12-13 17:43:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6518 states, 5488 states have (on average 1.430393586005831) internal successors, (7850), 5586 states have internal predecessors, (7850), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-12-13 17:43:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 9442 transitions. [2022-12-13 17:43:05,214 INFO L78 Accepts]: Start accepts. Automaton has 6518 states and 9442 transitions. Word has length 67 [2022-12-13 17:43:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:05,214 INFO L495 AbstractCegarLoop]: Abstraction has 6518 states and 9442 transitions. [2022-12-13 17:43:05,214 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), 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-12-13 17:43:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 6518 states and 9442 transitions. [2022-12-13 17:43:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:05,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:05,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:05,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:43:05,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 129109773, now seen corresponding path program 1 times [2022-12-13 17:43:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:05,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478882190] [2022-12-13 17:43:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:05,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478882190] [2022-12-13 17:43:05,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478882190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:05,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:05,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:43:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664014006] [2022-12-13 17:43:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:43:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:43:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:43:05,308 INFO L87 Difference]: Start difference. First operand 6518 states and 9442 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-12-13 17:43:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:06,310 INFO L93 Difference]: Finished difference Result 14437 states and 21460 transitions. [2022-12-13 17:43:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:43:06,311 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), 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 67 [2022-12-13 17:43:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:06,332 INFO L225 Difference]: With dead ends: 14437 [2022-12-13 17:43:06,332 INFO L226 Difference]: Without dead ends: 7930 [2022-12-13 17:43:06,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:43:06,340 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 184 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 592 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:43:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7930 states. [2022-12-13 17:43:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7930 to 6623. [2022-12-13 17:43:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 5593 states have (on average 1.4176649383157518) internal successors, (7929), 5691 states have internal predecessors, (7929), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-12-13 17:43:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 9521 transitions. [2022-12-13 17:43:06,787 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 9521 transitions. Word has length 67 [2022-12-13 17:43:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:06,787 INFO L495 AbstractCegarLoop]: Abstraction has 6623 states and 9521 transitions. [2022-12-13 17:43:06,787 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), 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-12-13 17:43:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 9521 transitions. [2022-12-13 17:43:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:06,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:06,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:06,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:43:06,789 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1515313167, now seen corresponding path program 1 times [2022-12-13 17:43:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:06,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756337288] [2022-12-13 17:43:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:06,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:06,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756337288] [2022-12-13 17:43:06,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756337288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:06,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:06,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:43:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629203348] [2022-12-13 17:43:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:06,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:43:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:43:06,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:43:06,900 INFO L87 Difference]: Start difference. First operand 6623 states and 9521 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:07,757 INFO L93 Difference]: Finished difference Result 8700 states and 12585 transitions. [2022-12-13 17:43:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:43:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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 67 [2022-12-13 17:43:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:07,772 INFO L225 Difference]: With dead ends: 8700 [2022-12-13 17:43:07,772 INFO L226 Difference]: Without dead ends: 5018 [2022-12-13 17:43:07,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:43:07,780 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 689 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:07,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 583 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:43:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2022-12-13 17:43:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4098. [2022-12-13 17:43:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 3451 states have (on average 1.4001738626485076) internal successors, (4832), 3509 states have internal predecessors, (4832), 387 states have call successors, (387), 226 states have call predecessors, (387), 254 states have return successors, (556), 370 states have call predecessors, (556), 387 states have call successors, (556) [2022-12-13 17:43:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5775 transitions. [2022-12-13 17:43:08,099 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5775 transitions. Word has length 67 [2022-12-13 17:43:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:08,099 INFO L495 AbstractCegarLoop]: Abstraction has 4098 states and 5775 transitions. [2022-12-13 17:43:08,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5775 transitions. [2022-12-13 17:43:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:08,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:08,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:08,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:43:08,100 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1381299661, now seen corresponding path program 1 times [2022-12-13 17:43:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:08,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573843377] [2022-12-13 17:43:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:08,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573843377] [2022-12-13 17:43:08,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573843377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:08,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:08,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:43:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898520471] [2022-12-13 17:43:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:43:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:43:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:43:08,201 INFO L87 Difference]: Start difference. First operand 4098 states and 5775 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:09,539 INFO L93 Difference]: Finished difference Result 12716 states and 18070 transitions. [2022-12-13 17:43:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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 67 [2022-12-13 17:43:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:09,557 INFO L225 Difference]: With dead ends: 12716 [2022-12-13 17:43:09,558 INFO L226 Difference]: Without dead ends: 8630 [2022-12-13 17:43:09,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:43:09,565 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 586 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:09,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 660 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:43:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2022-12-13 17:43:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 7038. [2022-12-13 17:43:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 5920 states have (on average 1.383614864864865) internal successors, (8191), 6045 states have internal predecessors, (8191), 643 states have call successors, (643), 390 states have call predecessors, (643), 469 states have return successors, (994), 618 states have call predecessors, (994), 643 states have call successors, (994) [2022-12-13 17:43:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9828 transitions. [2022-12-13 17:43:10,119 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9828 transitions. Word has length 67 [2022-12-13 17:43:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:10,119 INFO L495 AbstractCegarLoop]: Abstraction has 7038 states and 9828 transitions. [2022-12-13 17:43:10,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9828 transitions. [2022-12-13 17:43:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:10,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:10,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:43:10,121 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1600154379, now seen corresponding path program 1 times [2022-12-13 17:43:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:10,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395370006] [2022-12-13 17:43:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395370006] [2022-12-13 17:43:10,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395370006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:10,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:10,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:43:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852032724] [2022-12-13 17:43:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:10,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:43:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:43:10,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:43:10,221 INFO L87 Difference]: Start difference. First operand 7038 states and 9828 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:11,376 INFO L93 Difference]: Finished difference Result 13044 states and 18132 transitions. [2022-12-13 17:43:11,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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 67 [2022-12-13 17:43:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:11,391 INFO L225 Difference]: With dead ends: 13044 [2022-12-13 17:43:11,391 INFO L226 Difference]: Without dead ends: 7554 [2022-12-13 17:43:11,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:43:11,400 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 526 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:11,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 657 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7554 states. [2022-12-13 17:43:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7554 to 5882. [2022-12-13 17:43:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5882 states, 4976 states have (on average 1.3587218649517685) internal successors, (6761), 5077 states have internal predecessors, (6761), 519 states have call successors, (519), 326 states have call predecessors, (519), 381 states have return successors, (774), 486 states have call predecessors, (774), 519 states have call successors, (774) [2022-12-13 17:43:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 8054 transitions. [2022-12-13 17:43:11,874 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 8054 transitions. Word has length 67 [2022-12-13 17:43:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:11,874 INFO L495 AbstractCegarLoop]: Abstraction has 5882 states and 8054 transitions. [2022-12-13 17:43:11,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 8054 transitions. [2022-12-13 17:43:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:11,875 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:11,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:11,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:43:11,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2022856205, now seen corresponding path program 1 times [2022-12-13 17:43:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:11,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576325810] [2022-12-13 17:43:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:11,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576325810] [2022-12-13 17:43:11,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576325810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:11,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:11,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:43:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095969350] [2022-12-13 17:43:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:11,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:43:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:43:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:43:11,990 INFO L87 Difference]: Start difference. First operand 5882 states and 8054 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:13,362 INFO L93 Difference]: Finished difference Result 11056 states and 15233 transitions. [2022-12-13 17:43:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:13,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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 67 [2022-12-13 17:43:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:13,377 INFO L225 Difference]: With dead ends: 11056 [2022-12-13 17:43:13,377 INFO L226 Difference]: Without dead ends: 7496 [2022-12-13 17:43:13,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:43:13,385 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 561 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:13,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 653 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2022-12-13 17:43:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 5849. [2022-12-13 17:43:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 4953 states have (on average 1.352109832424793) internal successors, (6697), 5044 states have internal predecessors, (6697), 519 states have call successors, (519), 326 states have call predecessors, (519), 371 states have return successors, (730), 482 states have call predecessors, (730), 519 states have call successors, (730) [2022-12-13 17:43:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 7946 transitions. [2022-12-13 17:43:13,890 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 7946 transitions. Word has length 67 [2022-12-13 17:43:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:13,890 INFO L495 AbstractCegarLoop]: Abstraction has 5849 states and 7946 transitions. [2022-12-13 17:43:13,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 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-12-13 17:43:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 7946 transitions. [2022-12-13 17:43:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:43:13,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:13,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:13,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:43:13,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1205207755, now seen corresponding path program 1 times [2022-12-13 17:43:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049590240] [2022-12-13 17:43:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:13,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049590240] [2022-12-13 17:43:13,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049590240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:13,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:13,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:43:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391785428] [2022-12-13 17:43:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:13,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:43:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:43:13,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:13,953 INFO L87 Difference]: Start difference. First operand 5849 states and 7946 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-12-13 17:43:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:15,383 INFO L93 Difference]: Finished difference Result 16695 states and 23064 transitions. [2022-12-13 17:43:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:43:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 67 [2022-12-13 17:43:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:15,405 INFO L225 Difference]: With dead ends: 16695 [2022-12-13 17:43:15,405 INFO L226 Difference]: Without dead ends: 10860 [2022-12-13 17:43:15,414 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-12-13 17:43:15,414 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 614 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:15,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 375 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:43:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2022-12-13 17:43:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9142. [2022-12-13 17:43:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9142 states, 7750 states have (on average 1.3396129032258064) internal successors, (10382), 7878 states have internal predecessors, (10382), 788 states have call successors, (788), 506 states have call predecessors, (788), 598 states have return successors, (1266), 761 states have call predecessors, (1266), 788 states have call successors, (1266) [2022-12-13 17:43:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9142 states to 9142 states and 12436 transitions. [2022-12-13 17:43:16,184 INFO L78 Accepts]: Start accepts. Automaton has 9142 states and 12436 transitions. Word has length 67 [2022-12-13 17:43:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:16,185 INFO L495 AbstractCegarLoop]: Abstraction has 9142 states and 12436 transitions. [2022-12-13 17:43:16,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-12-13 17:43:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9142 states and 12436 transitions. [2022-12-13 17:43:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:43:16,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:16,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:43:16,186 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash 485360651, now seen corresponding path program 1 times [2022-12-13 17:43:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:16,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064619976] [2022-12-13 17:43:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:16,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064619976] [2022-12-13 17:43:16,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064619976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:16,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:16,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:43:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500581183] [2022-12-13 17:43:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:16,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:43:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:43:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:43:16,226 INFO L87 Difference]: Start difference. First operand 9142 states and 12436 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 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-12-13 17:43:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:18,072 INFO L93 Difference]: Finished difference Result 25812 states and 35395 transitions. [2022-12-13 17:43:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:43:18,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 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 68 [2022-12-13 17:43:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:18,125 INFO L225 Difference]: With dead ends: 25812 [2022-12-13 17:43:18,125 INFO L226 Difference]: Without dead ends: 16594 [2022-12-13 17:43:18,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:43:18,147 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 487 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:18,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 368 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:43:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16594 states. [2022-12-13 17:43:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16594 to 14036. [2022-12-13 17:43:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 11860 states have (on average 1.3244519392917369) internal successors, (15708), 12058 states have internal predecessors, (15708), 1224 states have call successors, (1224), 800 states have call predecessors, (1224), 946 states have return successors, (1951), 1181 states have call predecessors, (1951), 1224 states have call successors, (1951) [2022-12-13 17:43:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 18883 transitions. [2022-12-13 17:43:19,397 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 18883 transitions. Word has length 68 [2022-12-13 17:43:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:19,397 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 18883 transitions. [2022-12-13 17:43:19,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 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-12-13 17:43:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 18883 transitions. [2022-12-13 17:43:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 17:43:19,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:19,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:19,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:43:19,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1575374325, now seen corresponding path program 1 times [2022-12-13 17:43:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:19,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17180121] [2022-12-13 17:43:19,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:19,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 17:43:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:43:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:19,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17180121] [2022-12-13 17:43:19,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17180121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:19,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:19,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:43:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821358539] [2022-12-13 17:43:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:43:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:43:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:19,470 INFO L87 Difference]: Start difference. First operand 14036 states and 18883 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:43:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:22,784 INFO L93 Difference]: Finished difference Result 46372 states and 62901 transitions. [2022-12-13 17:43:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:43:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2022-12-13 17:43:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:22,856 INFO L225 Difference]: With dead ends: 46372 [2022-12-13 17:43:22,856 INFO L226 Difference]: Without dead ends: 32350 [2022-12-13 17:43:22,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:43:22,886 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 465 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:22,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 523 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32350 states. [2022-12-13 17:43:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32350 to 27600. [2022-12-13 17:43:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27600 states, 23163 states have (on average 1.307127746837629) internal successors, (30277), 23666 states have internal predecessors, (30277), 2379 states have call successors, (2379), 1582 states have call predecessors, (2379), 2052 states have return successors, (4447), 2359 states have call predecessors, (4447), 2379 states have call successors, (4447) [2022-12-13 17:43:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27600 states to 27600 states and 37103 transitions. [2022-12-13 17:43:25,573 INFO L78 Accepts]: Start accepts. Automaton has 27600 states and 37103 transitions. Word has length 86 [2022-12-13 17:43:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:25,574 INFO L495 AbstractCegarLoop]: Abstraction has 27600 states and 37103 transitions. [2022-12-13 17:43:25,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:43:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27600 states and 37103 transitions. [2022-12-13 17:43:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 17:43:25,576 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:25,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:25,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:43:25,576 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1602439927, now seen corresponding path program 1 times [2022-12-13 17:43:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:25,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726126991] [2022-12-13 17:43:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 17:43:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 17:43:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:25,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726126991] [2022-12-13 17:43:25,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726126991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:25,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:25,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:43:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675784297] [2022-12-13 17:43:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:25,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:43:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:43:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:43:25,615 INFO L87 Difference]: Start difference. First operand 27600 states and 37103 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:43:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:28,527 INFO L93 Difference]: Finished difference Result 57716 states and 78205 transitions. [2022-12-13 17:43:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:43:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2022-12-13 17:43:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:28,595 INFO L225 Difference]: With dead ends: 57716 [2022-12-13 17:43:28,595 INFO L226 Difference]: Without dead ends: 30130 [2022-12-13 17:43:28,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-12-13 17:43:28,630 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 373 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:28,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 267 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:43:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30130 states. [2022-12-13 17:43:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30130 to 25758. [2022-12-13 17:43:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25758 states, 21616 states have (on average 1.3134715025906736) internal successors, (28392), 22088 states have internal predecessors, (28392), 2216 states have call successors, (2216), 1464 states have call predecessors, (2216), 1920 states have return successors, (4255), 2209 states have call predecessors, (4255), 2216 states have call successors, (4255) [2022-12-13 17:43:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25758 states to 25758 states and 34863 transitions. [2022-12-13 17:43:31,254 INFO L78 Accepts]: Start accepts. Automaton has 25758 states and 34863 transitions. Word has length 86 [2022-12-13 17:43:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:31,254 INFO L495 AbstractCegarLoop]: Abstraction has 25758 states and 34863 transitions. [2022-12-13 17:43:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:43:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 25758 states and 34863 transitions. [2022-12-13 17:43:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 17:43:31,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:31,255 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:43:31,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1127248928, now seen corresponding path program 1 times [2022-12-13 17:43:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588681574] [2022-12-13 17:43:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 17:43:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:43:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588681574] [2022-12-13 17:43:31,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588681574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:31,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:31,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:43:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747075292] [2022-12-13 17:43:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:31,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:43:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:43:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:31,322 INFO L87 Difference]: Start difference. First operand 25758 states and 34863 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:43:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:37,260 INFO L93 Difference]: Finished difference Result 83783 states and 114191 transitions. [2022-12-13 17:43:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:43:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2022-12-13 17:43:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:37,408 INFO L225 Difference]: With dead ends: 83783 [2022-12-13 17:43:37,408 INFO L226 Difference]: Without dead ends: 58039 [2022-12-13 17:43:37,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:43:37,457 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 467 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:37,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 640 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:43:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58039 states. [2022-12-13 17:43:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58039 to 52449. [2022-12-13 17:43:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52449 states, 43922 states have (on average 1.2938618459997269) internal successors, (56829), 45131 states have internal predecessors, (56829), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9590), 4439 states have call predecessors, (9590), 4299 states have call successors, (9590) [2022-12-13 17:43:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52449 states to 52449 states and 70718 transitions. [2022-12-13 17:43:42,909 INFO L78 Accepts]: Start accepts. Automaton has 52449 states and 70718 transitions. Word has length 87 [2022-12-13 17:43:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:42,909 INFO L495 AbstractCegarLoop]: Abstraction has 52449 states and 70718 transitions. [2022-12-13 17:43:42,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:43:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 52449 states and 70718 transitions. [2022-12-13 17:43:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 17:43:42,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:42,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:42,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:43:42,913 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -337808753, now seen corresponding path program 1 times [2022-12-13 17:43:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970982878] [2022-12-13 17:43:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 17:43:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:43:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:42,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970982878] [2022-12-13 17:43:42,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970982878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:42,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:42,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:43:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120028209] [2022-12-13 17:43:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:42,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:43:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:42,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:43:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:43:42,982 INFO L87 Difference]: Start difference. First operand 52449 states and 70718 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-12-13 17:43:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:49,573 INFO L93 Difference]: Finished difference Result 103392 states and 139871 transitions. [2022-12-13 17:43:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:43:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 87 [2022-12-13 17:43:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:43:49,708 INFO L225 Difference]: With dead ends: 103392 [2022-12-13 17:43:49,708 INFO L226 Difference]: Without dead ends: 59729 [2022-12-13 17:43:49,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:43:49,765 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 925 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:43:49,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 643 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:43:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59729 states. [2022-12-13 17:43:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59729 to 52449. [2022-12-13 17:43:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52449 states, 43922 states have (on average 1.2862119211329175) internal successors, (56493), 45131 states have internal predecessors, (56493), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9302), 4439 states have call predecessors, (9302), 4299 states have call successors, (9302) [2022-12-13 17:43:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52449 states to 52449 states and 70094 transitions. [2022-12-13 17:43:55,354 INFO L78 Accepts]: Start accepts. Automaton has 52449 states and 70094 transitions. Word has length 87 [2022-12-13 17:43:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:43:55,354 INFO L495 AbstractCegarLoop]: Abstraction has 52449 states and 70094 transitions. [2022-12-13 17:43:55,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-12-13 17:43:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52449 states and 70094 transitions. [2022-12-13 17:43:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 17:43:55,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:43:55,357 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:55,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:43:55,357 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:43:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1367488674, now seen corresponding path program 1 times [2022-12-13 17:43:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:55,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705788519] [2022-12-13 17:43:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:43:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:43:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:43:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:43:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 17:43:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:43:55,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705788519] [2022-12-13 17:43:55,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705788519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:43:55,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:43:55,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:43:55,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263208308] [2022-12-13 17:43:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:43:55,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:43:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:43:55,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:43:55,402 INFO L87 Difference]: Start difference. First operand 52449 states and 70094 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:44:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:00,720 INFO L93 Difference]: Finished difference Result 58364 states and 78438 transitions. [2022-12-13 17:44:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:44:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 87 [2022-12-13 17:44:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:00,830 INFO L225 Difference]: With dead ends: 58364 [2022-12-13 17:44:00,830 INFO L226 Difference]: Without dead ends: 49588 [2022-12-13 17:44:00,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-12-13 17:44:00,853 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 373 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:00,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 265 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:44:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49588 states. [2022-12-13 17:44:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49588 to 43677. [2022-12-13 17:44:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43677 states, 36633 states have (on average 1.291185543089564) internal successors, (47300), 37670 states have internal predecessors, (47300), 3509 states have call successors, (3509), 2352 states have call predecessors, (3509), 3529 states have return successors, (7826), 3658 states have call predecessors, (7826), 3509 states have call successors, (7826) [2022-12-13 17:44:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43677 states to 43677 states and 58635 transitions. [2022-12-13 17:44:05,389 INFO L78 Accepts]: Start accepts. Automaton has 43677 states and 58635 transitions. Word has length 87 [2022-12-13 17:44:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:05,390 INFO L495 AbstractCegarLoop]: Abstraction has 43677 states and 58635 transitions. [2022-12-13 17:44:05,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:44:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 43677 states and 58635 transitions. [2022-12-13 17:44:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 17:44:05,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:05,391 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:05,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 17:44:05,392 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:44:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2054687254, now seen corresponding path program 1 times [2022-12-13 17:44:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:05,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005107496] [2022-12-13 17:44:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:44:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:44:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:44:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:44:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 17:44:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:44:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:05,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005107496] [2022-12-13 17:44:05,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005107496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:05,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:44:05,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:44:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283060896] [2022-12-13 17:44:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:44:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:44:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:44:05,455 INFO L87 Difference]: Start difference. First operand 43677 states and 58635 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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-12-13 17:44:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:11,671 INFO L93 Difference]: Finished difference Result 90366 states and 122073 transitions. [2022-12-13 17:44:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:44:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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 89 [2022-12-13 17:44:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:11,811 INFO L225 Difference]: With dead ends: 90366 [2022-12-13 17:44:11,811 INFO L226 Difference]: Without dead ends: 49902 [2022-12-13 17:44:11,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:44:11,870 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 884 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:11,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 708 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:44:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49902 states. [2022-12-13 17:44:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49902 to 38919. [2022-12-13 17:44:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38919 states, 32683 states have (on average 1.2850105559465166) internal successors, (41998), 33628 states have internal predecessors, (41998), 3069 states have call successors, (3069), 2060 states have call predecessors, (3069), 3161 states have return successors, (6714), 3234 states have call predecessors, (6714), 3069 states have call successors, (6714) [2022-12-13 17:44:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38919 states to 38919 states and 51781 transitions. [2022-12-13 17:44:16,427 INFO L78 Accepts]: Start accepts. Automaton has 38919 states and 51781 transitions. Word has length 89 [2022-12-13 17:44:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 38919 states and 51781 transitions. [2022-12-13 17:44:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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-12-13 17:44:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38919 states and 51781 transitions. [2022-12-13 17:44:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 17:44:16,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:44:16,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 17:44:16,429 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:44:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -817869291, now seen corresponding path program 1 times [2022-12-13 17:44:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306655330] [2022-12-13 17:44:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:44:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:44:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:44:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:44:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 17:44:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 17:44:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306655330] [2022-12-13 17:44:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306655330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:16,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:44:16,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:44:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037747127] [2022-12-13 17:44:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:44:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:16,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:44:16,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:44:16,490 INFO L87 Difference]: Start difference. First operand 38919 states and 51781 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:44:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:22,983 INFO L93 Difference]: Finished difference Result 92230 states and 124069 transitions. [2022-12-13 17:44:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:44:22,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2022-12-13 17:44:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:23,120 INFO L225 Difference]: With dead ends: 92230 [2022-12-13 17:44:23,120 INFO L226 Difference]: Without dead ends: 56498 [2022-12-13 17:44:23,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-12-13 17:44:23,181 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 466 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:23,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 430 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:44:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56498 states. [2022-12-13 17:44:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56498 to 49399. [2022-12-13 17:44:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49399 states, 41499 states have (on average 1.2823923468035374) internal successors, (53218), 42638 states have internal predecessors, (53218), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (8312), 4120 states have call predecessors, (8312), 3949 states have call successors, (8312) [2022-12-13 17:44:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49399 states to 49399 states and 65479 transitions. [2022-12-13 17:44:28,705 INFO L78 Accepts]: Start accepts. Automaton has 49399 states and 65479 transitions. Word has length 99 [2022-12-13 17:44:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:28,706 INFO L495 AbstractCegarLoop]: Abstraction has 49399 states and 65479 transitions. [2022-12-13 17:44:28,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:44:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49399 states and 65479 transitions. [2022-12-13 17:44:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 17:44:28,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:28,709 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, 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] [2022-12-13 17:44:28,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 17:44:28,709 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:44:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1957425714, now seen corresponding path program 1 times [2022-12-13 17:44:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019675165] [2022-12-13 17:44:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:44:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:44:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:44:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:44:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 17:44:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 17:44:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 17:44:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019675165] [2022-12-13 17:44:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019675165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:28,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:44:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:44:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761887565] [2022-12-13 17:44:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:44:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:44:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:44:28,792 INFO L87 Difference]: Start difference. First operand 49399 states and 65479 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 17:44:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:35,595 INFO L93 Difference]: Finished difference Result 94128 states and 126135 transitions. [2022-12-13 17:44:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:44:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 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 110 [2022-12-13 17:44:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:35,728 INFO L225 Difference]: With dead ends: 94128 [2022-12-13 17:44:35,728 INFO L226 Difference]: Without dead ends: 55238 [2022-12-13 17:44:35,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:44:35,789 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1520 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:35,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 747 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:44:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55238 states. [2022-12-13 17:44:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55238 to 49399. [2022-12-13 17:44:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49399 states, 41499 states have (on average 1.2736210511096653) internal successors, (52854), 42638 states have internal predecessors, (52854), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (7766), 4120 states have call predecessors, (7766), 3949 states have call successors, (7766) [2022-12-13 17:44:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49399 states to 49399 states and 64569 transitions. [2022-12-13 17:44:41,265 INFO L78 Accepts]: Start accepts. Automaton has 49399 states and 64569 transitions. Word has length 110 [2022-12-13 17:44:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:41,266 INFO L495 AbstractCegarLoop]: Abstraction has 49399 states and 64569 transitions. [2022-12-13 17:44:41,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 17:44:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 49399 states and 64569 transitions. [2022-12-13 17:44:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 17:44:41,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:41,269 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:41,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 17:44:41,270 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:44:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 304616749, now seen corresponding path program 1 times [2022-12-13 17:44:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:41,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629016434] [2022-12-13 17:44:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:44:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:44:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:44:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:44:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:44:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 17:44:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 17:44:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 17:44:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 17:44:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629016434] [2022-12-13 17:44:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629016434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:44:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:44:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:44:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992097481] [2022-12-13 17:44:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:44:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:44:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:44:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:44:41,338 INFO L87 Difference]: Start difference. First operand 49399 states and 64569 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:44:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:47,634 INFO L93 Difference]: Finished difference Result 56234 states and 73929 transitions. [2022-12-13 17:44:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:44:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 116 [2022-12-13 17:44:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:44:47,759 INFO L225 Difference]: With dead ends: 56234 [2022-12-13 17:44:47,759 INFO L226 Difference]: Without dead ends: 56232 [2022-12-13 17:44:47,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-12-13 17:44:47,777 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 366 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:44:47,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 243 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:44:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56232 states. [2022-12-13 17:44:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56232 to 49397. [2022-12-13 17:44:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49397 states, 41499 states have (on average 1.2692354032627293) internal successors, (52672), 42636 states have internal predecessors, (52672), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (7766), 4120 states have call predecessors, (7766), 3949 states have call successors, (7766) [2022-12-13 17:44:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49397 states to 49397 states and 64387 transitions. [2022-12-13 17:44:53,541 INFO L78 Accepts]: Start accepts. Automaton has 49397 states and 64387 transitions. Word has length 116 [2022-12-13 17:44:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:44:53,541 INFO L495 AbstractCegarLoop]: Abstraction has 49397 states and 64387 transitions. [2022-12-13 17:44:53,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:44:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 49397 states and 64387 transitions. [2022-12-13 17:44:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 17:44:53,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:44:53,545 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:53,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 17:44:53,545 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 17:44:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 853184968, now seen corresponding path program 1 times [2022-12-13 17:44:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:53,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86727280] [2022-12-13 17:44:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:53,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:53,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:44:53,593 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:44:53,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-12-13 17:44:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-12-13 17:44:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-12-13 17:44:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-12-13 17:44:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-12-13 17:44:53,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-12-13 17:44:53,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 17:44:53,598 INFO L445 BasicCegarLoop]: Path program 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] [2022-12-13 17:44:53,601 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:44:53,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:44:53 BoogieIcfgContainer [2022-12-13 17:44:53,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:44:53,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:44:53,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:44:53,654 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:44:53,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:42:55" (3/4) ... [2022-12-13 17:44:53,655 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:44:53,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:44:53,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:44:53,707 INFO L158 Benchmark]: Toolchain (without parser) took 119293.97ms. Allocated memory was 132.1MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 97.1MB in the beginning and 963.0MB in the end (delta: -865.9MB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2022-12-13 17:44:53,707 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.30ms. Allocated memory is still 132.1MB. Free memory was 97.1MB in the beginning and 83.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 132.1MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: Boogie Preprocessor took 20.63ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: RCFGBuilder took 410.37ms. Allocated memory is still 132.1MB. Free memory was 79.3MB in the beginning and 59.3MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: TraceAbstraction took 118566.28ms. Allocated memory was 132.1MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 58.6MB in the beginning and 973.5MB in the end (delta: -914.9MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-13 17:44:53,708 INFO L158 Benchmark]: Witness Printer took 53.40ms. Allocated memory is still 4.1GB. Free memory was 973.5MB in the beginning and 963.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:44:53,709 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.19ms. Allocated memory is still 132.1MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.30ms. Allocated memory is still 132.1MB. Free memory was 97.1MB in the beginning and 83.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 132.1MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.63ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.37ms. Allocated memory is still 132.1MB. Free memory was 79.3MB in the beginning and 59.3MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 118566.28ms. Allocated memory was 132.1MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 58.6MB in the beginning and 973.5MB in the end (delta: -914.9MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 53.40ms. Allocated memory is still 4.1GB. Free memory was 973.5MB in the beginning and 963.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 113]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L546] FCALL update_channels() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] RET init_threads() [L548] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L344] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L349] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L354] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L359] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L364] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L369] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] RET fire_delta_events() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L166] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L176] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L185] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L195] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L204] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L214] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L549] RET activate_threads() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L382] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L387] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L392] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L397] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L402] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L407] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET reset_delta_events() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L553] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L556] kernel_st = 1 [L557] CALL eval() [L277] int tmp ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L281] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L105] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L281] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L61] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L166] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L176] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=2147483647] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L185] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L186] COND TRUE E_1 == 1 [L187] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, __retres1=1, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, token=2147483647] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L204] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L214] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, tmp___1=0, token=2147483647] [L455] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L113] token += 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: 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 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 118.5s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 68.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14252 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13958 mSDsluCounter, 14880 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10765 mSDsCounter, 2027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16443 IncrementalHoareTripleChecker+Invalid, 18470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2027 mSolverCounterUnsat, 4115 mSDtfsCounter, 16443 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52449occurred in iteration=20, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 74769 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2097 NumberOfCodeBlocks, 2097 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1954 ConstructedInterpolants, 0 QuantifiedInterpolants, 4665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 173/173 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-12-13 17:44:53,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668bc5d3-1eda-4bd5-8898-e56be01fefd8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)