./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:27:38,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:27:38,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:27:38,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:27:38,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:27:38,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:27:38,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:27:38,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:27:38,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:27:38,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:27:38,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:27:38,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:27:38,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:27:38,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:27:38,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:27:38,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:27:38,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:27:38,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:27:38,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:27:38,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:27:38,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:27:38,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:27:38,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:27:38,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:27:38,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:27:38,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:27:38,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:27:38,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:27:38,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:27:38,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:27:38,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:27:38,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:27:38,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:27:38,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:27:38,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:27:38,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:27:38,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:27:38,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:27:38,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:27:38,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:27:38,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:27:38,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 18:27:38,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:27:38,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:27:38,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:27:38,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:27:38,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:27:38,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:27:38,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:27:38,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:27:38,347 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:27:38,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:27:38,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:27:38,348 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:27:38,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:27:38,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 18:27:38,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:27:38,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:27:38,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:27:38,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:27:38,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:27:38,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:27:38,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:27:38,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:27:38,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:27:38,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:27:38,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:27:38,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:27:38,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:27:38,352 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:27:38,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:27:38,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:27:38,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-11-18 18:27:38,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:27:38,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:27:38,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:27:38,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:27:38,677 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:27:38,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-18 18:27:38,742 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/data/fea8ccd2e/49fd40a0a3954eb78769d82828dfc365/FLAGdad5b2a59 [2022-11-18 18:27:39,242 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:27:39,243 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-18 18:27:39,251 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/data/fea8ccd2e/49fd40a0a3954eb78769d82828dfc365/FLAGdad5b2a59 [2022-11-18 18:27:39,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/data/fea8ccd2e/49fd40a0a3954eb78769d82828dfc365 [2022-11-18 18:27:39,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:27:39,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:27:39,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:27:39,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:27:39,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:27:39,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:39,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c19b661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39, skipping insertion in model container [2022-11-18 18:27:39,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:39,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:27:39,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:27:39,835 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-18 18:27:39,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:27:39,894 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:27:39,906 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-18 18:27:39,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:27:39,946 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:27:39,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39 WrapperNode [2022-11-18 18:27:39,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:27:39,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:27:39,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:27:39,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:27:39,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:39,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:39,986 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 219 [2022-11-18 18:27:39,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:27:39,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:27:39,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:27:39,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:27:39,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:39,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,014 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:27:40,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:27:40,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:27:40,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:27:40,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (1/1) ... [2022-11-18 18:27:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:27:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:27:40,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:27:40,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:27:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:27:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-18 18:27:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-18 18:27:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-18 18:27:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-18 18:27:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-18 18:27:40,129 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-18 18:27:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-18 18:27:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-18 18:27:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-18 18:27:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-18 18:27:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:27:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-18 18:27:40,131 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-18 18:27:40,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:27:40,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:27:40,246 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:27:40,249 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:27:40,584 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:27:40,592 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:27:40,592 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 18:27:40,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:27:40 BoogieIcfgContainer [2022-11-18 18:27:40,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:27:40,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:27:40,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:27:40,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:27:40,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:27:39" (1/3) ... [2022-11-18 18:27:40,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b36d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:27:40, skipping insertion in model container [2022-11-18 18:27:40,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:27:39" (2/3) ... [2022-11-18 18:27:40,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b36d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:27:40, skipping insertion in model container [2022-11-18 18:27:40,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:27:40" (3/3) ... [2022-11-18 18:27:40,605 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-11-18 18:27:40,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:27:40,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 18:27:40,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:27:40,741 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;@33e719f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:27:40,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 18:27:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-18 18:27:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:27:40,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:40,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:40,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1696984144, now seen corresponding path program 1 times [2022-11-18 18:27:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:40,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093294484] [2022-11-18 18:27:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:41,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093294484] [2022-11-18 18:27:41,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093294484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:41,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:41,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:27:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655185114] [2022-11-18 18:27:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:41,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:27:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:27:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:27:41,432 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:42,267 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2022-11-18 18:27:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:27:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:27:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:42,296 INFO L225 Difference]: With dead ends: 357 [2022-11-18 18:27:42,297 INFO L226 Difference]: Without dead ends: 243 [2022-11-18 18:27:42,300 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-11-18 18:27:42,304 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 307 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:42,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 426 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:27:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-18 18:27:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2022-11-18 18:27:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 163 states have internal predecessors, (230), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-18 18:27:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2022-11-18 18:27:42,382 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 55 [2022-11-18 18:27:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:42,383 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2022-11-18 18:27:42,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2022-11-18 18:27:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:27:42,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:42,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:27:42,387 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 767450028, now seen corresponding path program 1 times [2022-11-18 18:27:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:42,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683268676] [2022-11-18 18:27:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:42,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:42,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683268676] [2022-11-18 18:27:42,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683268676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:42,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:42,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125951447] [2022-11-18 18:27:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:42,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:42,666 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:43,527 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2022-11-18 18:27:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 18:27:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:27:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:43,530 INFO L225 Difference]: With dead ends: 545 [2022-11-18 18:27:43,530 INFO L226 Difference]: Without dead ends: 354 [2022-11-18 18:27:43,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:27:43,533 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 291 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:43,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 678 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:27:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-18 18:27:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2022-11-18 18:27:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.445414847161572) internal successors, (331), 235 states have internal predecessors, (331), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-18 18:27:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2022-11-18 18:27:43,580 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 55 [2022-11-18 18:27:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:43,580 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2022-11-18 18:27:43,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2022-11-18 18:27:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:27:43,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:43,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:43,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:27:43,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash -129943250, now seen corresponding path program 1 times [2022-11-18 18:27:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:43,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192649629] [2022-11-18 18:27:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:43,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192649629] [2022-11-18 18:27:43,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192649629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:43,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:43,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617814060] [2022-11-18 18:27:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:43,745 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:44,496 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2022-11-18 18:27:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:27:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:27:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:44,504 INFO L225 Difference]: With dead ends: 890 [2022-11-18 18:27:44,504 INFO L226 Difference]: Without dead ends: 611 [2022-11-18 18:27:44,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:27:44,519 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 346 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:44,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 666 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:27:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-18 18:27:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 457. [2022-11-18 18:27:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.4316939890710383) internal successors, (524), 374 states have internal predecessors, (524), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-18 18:27:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 643 transitions. [2022-11-18 18:27:44,609 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 643 transitions. Word has length 55 [2022-11-18 18:27:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:44,609 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 643 transitions. [2022-11-18 18:27:44,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 643 transitions. [2022-11-18 18:27:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:27:44,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:44,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:44,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:27:44,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash 118203244, now seen corresponding path program 1 times [2022-11-18 18:27:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:44,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684966526] [2022-11-18 18:27:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:44,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684966526] [2022-11-18 18:27:44,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684966526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:44,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:44,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952732377] [2022-11-18 18:27:44,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:44,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:44,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:44,830 INFO L87 Difference]: Start difference. First operand 457 states and 643 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:45,618 INFO L93 Difference]: Finished difference Result 1424 states and 2007 transitions. [2022-11-18 18:27:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:27:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:27:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:45,627 INFO L225 Difference]: With dead ends: 1424 [2022-11-18 18:27:45,628 INFO L226 Difference]: Without dead ends: 976 [2022-11-18 18:27:45,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:27:45,643 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 286 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:45,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 640 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:27:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-11-18 18:27:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 758. [2022-11-18 18:27:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 609 states have (on average 1.4220032840722496) internal successors, (866), 621 states have internal predecessors, (866), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-18 18:27:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1071 transitions. [2022-11-18 18:27:45,737 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1071 transitions. Word has length 55 [2022-11-18 18:27:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:45,738 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1071 transitions. [2022-11-18 18:27:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1071 transitions. [2022-11-18 18:27:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 18:27:45,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:45,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:45,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:27:45,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash 541849966, now seen corresponding path program 1 times [2022-11-18 18:27:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:45,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190731763] [2022-11-18 18:27:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:45,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190731763] [2022-11-18 18:27:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190731763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:27:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771905341] [2022-11-18 18:27:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:45,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:27:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:27:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:27:45,877 INFO L87 Difference]: Start difference. First operand 758 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:46,512 INFO L93 Difference]: Finished difference Result 2117 states and 3003 transitions. [2022-11-18 18:27:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:27:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-18 18:27:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:46,519 INFO L225 Difference]: With dead ends: 2117 [2022-11-18 18:27:46,519 INFO L226 Difference]: Without dead ends: 1369 [2022-11-18 18:27:46,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:27:46,524 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 407 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:46,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 486 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:27:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-11-18 18:27:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1162. [2022-11-18 18:27:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 930 states have (on average 1.3989247311827957) internal successors, (1301), 951 states have internal predecessors, (1301), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:27:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1614 transitions. [2022-11-18 18:27:46,650 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1614 transitions. Word has length 55 [2022-11-18 18:27:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:46,651 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1614 transitions. [2022-11-18 18:27:46,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1614 transitions. [2022-11-18 18:27:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:46,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:46,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:46,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:27:46,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2042576822, now seen corresponding path program 1 times [2022-11-18 18:27:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59060097] [2022-11-18 18:27:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59060097] [2022-11-18 18:27:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59060097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:46,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:46,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576437982] [2022-11-18 18:27:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:46,788 INFO L87 Difference]: Start difference. First operand 1162 states and 1614 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:47,426 INFO L93 Difference]: Finished difference Result 2531 states and 3569 transitions. [2022-11-18 18:27:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:27:47,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:47,433 INFO L225 Difference]: With dead ends: 2531 [2022-11-18 18:27:47,434 INFO L226 Difference]: Without dead ends: 1379 [2022-11-18 18:27:47,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:27:47,437 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:47,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 476 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:27:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-11-18 18:27:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1177. [2022-11-18 18:27:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3830687830687831) internal successors, (1307), 966 states have internal predecessors, (1307), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:27:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2022-11-18 18:27:47,534 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 56 [2022-11-18 18:27:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:47,535 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2022-11-18 18:27:47,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2022-11-18 18:27:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:47,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:47,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:47,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:27:47,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2114963380, now seen corresponding path program 1 times [2022-11-18 18:27:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749618193] [2022-11-18 18:27:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:47,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749618193] [2022-11-18 18:27:47,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749618193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:47,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:47,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820674186] [2022-11-18 18:27:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:47,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:47,672 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:48,290 INFO L93 Difference]: Finished difference Result 2586 states and 3614 transitions. [2022-11-18 18:27:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:27:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:48,299 INFO L225 Difference]: With dead ends: 2586 [2022-11-18 18:27:48,299 INFO L226 Difference]: Without dead ends: 1419 [2022-11-18 18:27:48,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:27:48,304 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 135 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:48,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 471 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:27:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-11-18 18:27:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1219. [2022-11-18 18:27:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 987 states have (on average 1.3667679837892603) internal successors, (1349), 1008 states have internal predecessors, (1349), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-18 18:27:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1662 transitions. [2022-11-18 18:27:48,421 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1662 transitions. Word has length 56 [2022-11-18 18:27:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:48,422 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1662 transitions. [2022-11-18 18:27:48,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1662 transitions. [2022-11-18 18:27:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:48,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:48,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:48,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:27:48,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -191735346, now seen corresponding path program 1 times [2022-11-18 18:27:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503962669] [2022-11-18 18:27:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:48,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:48,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503962669] [2022-11-18 18:27:48,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503962669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:48,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:48,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:27:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679212205] [2022-11-18 18:27:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:27:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:27:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:27:48,566 INFO L87 Difference]: Start difference. First operand 1219 states and 1662 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:49,217 INFO L93 Difference]: Finished difference Result 1767 states and 2410 transitions. [2022-11-18 18:27:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:27:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:49,223 INFO L225 Difference]: With dead ends: 1767 [2022-11-18 18:27:49,223 INFO L226 Difference]: Without dead ends: 1048 [2022-11-18 18:27:49,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-18 18:27:49,226 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 453 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:49,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 459 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:27:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-18 18:27:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 878. [2022-11-18 18:27:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 709 states have (on average 1.3540197461212975) internal successors, (960), 723 states have internal predecessors, (960), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-11-18 18:27:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1175 transitions. [2022-11-18 18:27:49,294 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1175 transitions. Word has length 56 [2022-11-18 18:27:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:49,295 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1175 transitions. [2022-11-18 18:27:49,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1175 transitions. [2022-11-18 18:27:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:49,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:49,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:27:49,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 27119372, now seen corresponding path program 1 times [2022-11-18 18:27:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:49,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438418951] [2022-11-18 18:27:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:49,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-11-18 18:27:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438418951] [2022-11-18 18:27:49,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438418951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:49,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:49,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:27:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110186766] [2022-11-18 18:27:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:49,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:27:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:27:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:27:49,435 INFO L87 Difference]: Start difference. First operand 878 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:50,165 INFO L93 Difference]: Finished difference Result 1710 states and 2296 transitions. [2022-11-18 18:27:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:27:50,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:50,171 INFO L225 Difference]: With dead ends: 1710 [2022-11-18 18:27:50,172 INFO L226 Difference]: Without dead ends: 1076 [2022-11-18 18:27:50,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:27:50,176 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 438 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:50,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 453 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:27:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-11-18 18:27:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 872. [2022-11-18 18:27:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.348936170212766) internal successors, (951), 717 states have internal predecessors, (951), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-11-18 18:27:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1158 transitions. [2022-11-18 18:27:50,248 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1158 transitions. Word has length 56 [2022-11-18 18:27:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:50,248 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1158 transitions. [2022-11-18 18:27:50,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1158 transitions. [2022-11-18 18:27:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:50,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:50,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:50,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:27:50,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 449821198, now seen corresponding path program 1 times [2022-11-18 18:27:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:50,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079148232] [2022-11-18 18:27:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079148232] [2022-11-18 18:27:50,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079148232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:50,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:50,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:27:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773421032] [2022-11-18 18:27:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:50,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:27:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:27:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:27:50,415 INFO L87 Difference]: Start difference. First operand 872 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:51,160 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2022-11-18 18:27:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:27:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:51,166 INFO L225 Difference]: With dead ends: 1649 [2022-11-18 18:27:51,166 INFO L226 Difference]: Without dead ends: 932 [2022-11-18 18:27:51,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-18 18:27:51,169 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:51,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 550 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:27:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-18 18:27:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 760. [2022-11-18 18:27:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.343042071197411) internal successors, (830), 628 states have internal predecessors, (830), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-11-18 18:27:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1002 transitions. [2022-11-18 18:27:51,247 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1002 transitions. Word has length 56 [2022-11-18 18:27:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:51,247 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1002 transitions. [2022-11-18 18:27:51,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1002 transitions. [2022-11-18 18:27:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 18:27:51,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:51,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:51,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:27:51,254 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -367827252, now seen corresponding path program 1 times [2022-11-18 18:27:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:51,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267249722] [2022-11-18 18:27:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:51,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267249722] [2022-11-18 18:27:51,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267249722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:51,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:51,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:27:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748812990] [2022-11-18 18:27:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:51,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:27:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:27:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:27:51,344 INFO L87 Difference]: Start difference. First operand 760 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:51,859 INFO L93 Difference]: Finished difference Result 2370 states and 3182 transitions. [2022-11-18 18:27:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:27:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-18 18:27:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:51,869 INFO L225 Difference]: With dead ends: 2370 [2022-11-18 18:27:51,869 INFO L226 Difference]: Without dead ends: 1621 [2022-11-18 18:27:51,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:27:51,873 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 418 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:51,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 302 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:27:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-18 18:27:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1447. [2022-11-18 18:27:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1177 states have (on average 1.3271028037383177) internal successors, (1562), 1194 states have internal predecessors, (1562), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-11-18 18:27:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1921 transitions. [2022-11-18 18:27:52,022 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1921 transitions. Word has length 56 [2022-11-18 18:27:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:52,023 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 1921 transitions. [2022-11-18 18:27:52,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:27:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1921 transitions. [2022-11-18 18:27:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 18:27:52,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:52,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:52,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:27:52,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1034084368, now seen corresponding path program 1 times [2022-11-18 18:27:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:52,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644539859] [2022-11-18 18:27:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:27:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644539859] [2022-11-18 18:27:52,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644539859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:52,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:52,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:27:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368561235] [2022-11-18 18:27:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:52,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:27:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:27:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:27:52,086 INFO L87 Difference]: Start difference. First operand 1447 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 18:27:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:52,670 INFO L93 Difference]: Finished difference Result 4136 states and 5521 transitions. [2022-11-18 18:27:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:27:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-11-18 18:27:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:52,693 INFO L225 Difference]: With dead ends: 4136 [2022-11-18 18:27:52,693 INFO L226 Difference]: Without dead ends: 2703 [2022-11-18 18:27:52,699 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-11-18 18:27:52,700 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 320 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:52,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 350 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:27:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-11-18 18:27:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2357. [2022-11-18 18:27:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1913 states have (on average 1.311552535284893) internal successors, (2509), 1940 states have internal predecessors, (2509), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-11-18 18:27:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3097 transitions. [2022-11-18 18:27:52,912 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3097 transitions. Word has length 57 [2022-11-18 18:27:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:52,914 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3097 transitions. [2022-11-18 18:27:52,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 18:27:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3097 transitions. [2022-11-18 18:27:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-18 18:27:52,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:52,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:27:52,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -286197174, now seen corresponding path program 1 times [2022-11-18 18:27:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:52,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408318855] [2022-11-18 18:27:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 18:27:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:27:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408318855] [2022-11-18 18:27:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408318855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:53,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:53,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:27:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544600975] [2022-11-18 18:27:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:27:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:27:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:27:53,042 INFO L87 Difference]: Start difference. First operand 2357 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:27:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:54,235 INFO L93 Difference]: Finished difference Result 7472 states and 9914 transitions. [2022-11-18 18:27:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:27:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-11-18 18:27:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:54,262 INFO L225 Difference]: With dead ends: 7472 [2022-11-18 18:27:54,262 INFO L226 Difference]: Without dead ends: 5131 [2022-11-18 18:27:54,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:27:54,270 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 703 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:54,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 485 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:27:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-11-18 18:27:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4605. [2022-11-18 18:27:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3722 states have (on average 1.2888232133261688) internal successors, (4797), 3791 states have internal predecessors, (4797), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-11-18 18:27:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6071 transitions. [2022-11-18 18:27:54,860 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6071 transitions. Word has length 74 [2022-11-18 18:27:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:54,860 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6071 transitions. [2022-11-18 18:27:54,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:27:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6071 transitions. [2022-11-18 18:27:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 18:27:54,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:54,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:27:54,865 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1327486831, now seen corresponding path program 1 times [2022-11-18 18:27:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:54,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711443939] [2022-11-18 18:27:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:27:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:27:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 18:27:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 18:27:55,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:55,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711443939] [2022-11-18 18:27:55,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711443939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:55,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:55,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:55,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217840887] [2022-11-18 18:27:55,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:55,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:55,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:55,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:55,137 INFO L87 Difference]: Start difference. First operand 4605 states and 6071 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:27:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:56,002 INFO L93 Difference]: Finished difference Result 8872 states and 11640 transitions. [2022-11-18 18:27:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:27:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-18 18:27:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:56,034 INFO L225 Difference]: With dead ends: 8872 [2022-11-18 18:27:56,034 INFO L226 Difference]: Without dead ends: 5201 [2022-11-18 18:27:56,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-18 18:27:56,044 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 565 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:56,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 311 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:27:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-18 18:27:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4573. [2022-11-18 18:27:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3686 states have (on average 1.2769940314704287) internal successors, (4707), 3759 states have internal predecessors, (4707), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-11-18 18:27:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5900 transitions. [2022-11-18 18:27:56,515 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5900 transitions. Word has length 90 [2022-11-18 18:27:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:56,516 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5900 transitions. [2022-11-18 18:27:56,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:27:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5900 transitions. [2022-11-18 18:27:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 18:27:56,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:56,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:56,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:27:56,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1400722515, now seen corresponding path program 1 times [2022-11-18 18:27:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:56,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699108435] [2022-11-18 18:27:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:27:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:27:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 18:27:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 18:27:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699108435] [2022-11-18 18:27:56,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699108435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:56,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:56,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:27:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178814536] [2022-11-18 18:27:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:27:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:27:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:27:56,583 INFO L87 Difference]: Start difference. First operand 4573 states and 5900 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 18:27:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:57,105 INFO L93 Difference]: Finished difference Result 5037 states and 6517 transitions. [2022-11-18 18:27:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:27:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-18 18:27:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:57,136 INFO L225 Difference]: With dead ends: 5037 [2022-11-18 18:27:57,137 INFO L226 Difference]: Without dead ends: 4141 [2022-11-18 18:27:57,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:27:57,146 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:57,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 211 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:27:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-11-18 18:27:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3679. [2022-11-18 18:27:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.281965006729475) internal successors, (3810), 3033 states have internal predecessors, (3810), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-11-18 18:27:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4762 transitions. [2022-11-18 18:27:57,669 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4762 transitions. Word has length 90 [2022-11-18 18:27:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:57,669 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4762 transitions. [2022-11-18 18:27:57,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 18:27:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4762 transitions. [2022-11-18 18:27:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 18:27:57,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:57,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:57,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:27:57,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1500452604, now seen corresponding path program 1 times [2022-11-18 18:27:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795625718] [2022-11-18 18:27:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 18:27:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 18:27:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:27:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 18:27:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:27:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 18:27:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 18:27:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 18:27:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:27:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 18:27:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:27:57,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795625718] [2022-11-18 18:27:57,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795625718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:27:57,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:27:57,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:27:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949965161] [2022-11-18 18:27:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:27:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:27:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:27:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:27:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:27:57,801 INFO L87 Difference]: Start difference. First operand 3679 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:27:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:27:59,072 INFO L93 Difference]: Finished difference Result 7051 states and 9090 transitions. [2022-11-18 18:27:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 18:27:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-18 18:27:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:27:59,091 INFO L225 Difference]: With dead ends: 7051 [2022-11-18 18:27:59,091 INFO L226 Difference]: Without dead ends: 4058 [2022-11-18 18:27:59,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-18 18:27:59,099 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1025 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:27:59,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 565 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 18:27:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-11-18 18:27:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3679. [2022-11-18 18:27:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.2671601615074024) internal successors, (3766), 3033 states have internal predecessors, (3766), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-18 18:27:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4652 transitions. [2022-11-18 18:27:59,443 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4652 transitions. Word has length 91 [2022-11-18 18:27:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:27:59,444 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4652 transitions. [2022-11-18 18:27:59,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 18:27:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4652 transitions. [2022-11-18 18:27:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 18:27:59,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:27:59,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:59,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 18:27:59,447 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:27:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:27:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -78861023, now seen corresponding path program 1 times [2022-11-18 18:27:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:27:59,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828902482] [2022-11-18 18:27:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:27:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:27:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:27:59,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:27:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:27:59,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:27:59,503 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:27:59,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-18 18:27:59,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-18 18:27:59,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-18 18:27:59,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-18 18:27:59,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 18:27:59,511 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:27:59,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:27:59,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:27:59 BoogieIcfgContainer [2022-11-18 18:27:59,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:27:59,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:27:59,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:27:59,613 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:27:59,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:27:40" (3/4) ... [2022-11-18 18:27:59,615 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:27:59,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:27:59,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:27:59,707 INFO L158 Benchmark]: Toolchain (without parser) took 20099.15ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 85.5MB in the beginning and 508.4MB in the end (delta: -422.9MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,708 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:27:59,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 125.8MB. Free memory was 85.2MB in the beginning and 97.4MB in the end (delta: -12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:27:59,708 INFO L158 Benchmark]: Boogie Preprocessor took 31.09ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 94.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,709 INFO L158 Benchmark]: RCFGBuilder took 575.53ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 76.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,709 INFO L158 Benchmark]: TraceAbstraction took 19015.24ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 75.4MB in the beginning and 515.7MB in the end (delta: -440.3MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,709 INFO L158 Benchmark]: Witness Printer took 94.39ms. Allocated memory is still 625.0MB. Free memory was 515.7MB in the beginning and 508.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 18:27:59,711 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.21ms. Allocated memory is still 125.8MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 125.8MB. Free memory was 85.2MB in the beginning and 97.4MB in the end (delta: -12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.09ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 94.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 575.53ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 76.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19015.24ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 75.4MB in the beginning and 515.7MB in the end (delta: -440.3MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 94.39ms. Allocated memory is still 625.0MB. Free memory was 515.7MB in the beginning and 508.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m_st ; [L29] int t1_i ; [L30] int M_E = 2; [L32] int E_M = 2; [L31] int T1_E = 2; [L28] int m_i ; [L33] int E_1 = 2; [L24] int m_pc = 0; [L27] int t1_st ; [L39] int local ; [L25] int t1_pc = 0; [L37] int token ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L341] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: 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, 113 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6610 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6460 mSDsluCounter, 7529 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5456 mSDsCounter, 1351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7777 IncrementalHoareTripleChecker+Invalid, 9128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1351 mSolverCounterUnsat, 2073 mSDtfsCounter, 7777 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4605occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4151 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 92/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 18:27:59,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aff79ad-b227-44ca-a4d8-f48393c320ea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)