./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 527bcce2 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_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:25:03,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:25:03,461 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-21 22:25:03,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:25:03,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:25:03,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:25:03,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:25:03,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:25:03,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:25:03,544 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:25:03,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:25:03,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:25:03,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:25:03,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:25:03,550 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:25:03,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:25:03,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:25:03,552 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:25:03,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:25:03,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:25:03,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:25:03,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:25:03,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:25:03,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:25:03,557 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-21 22:25:03,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:25:03,558 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:25:03,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:25:03,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:25:03,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:25:03,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:25:03,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:25:03,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:25:03,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:25:03,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:25:03,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:25:03,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:25:03,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:25:03,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:25:03,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:25:03,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:25:03,565 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:25:03,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:25:03,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:25:03,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/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_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2023-11-21 22:25:03,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:25:04,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:25:04,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:25:04,027 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:25:04,028 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:25:04,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2023-11-21 22:25:07,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:25:08,091 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:25:08,092 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2023-11-21 22:25:08,107 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/data/484fc8b28/d3844d7e495b4472823a187b71a0256b/FLAGf2615cc2b [2023-11-21 22:25:08,126 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/data/484fc8b28/d3844d7e495b4472823a187b71a0256b [2023-11-21 22:25:08,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:25:08,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:25:08,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:25:08,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:25:08,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:25:08,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160e189c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08, skipping insertion in model container [2023-11-21 22:25:08,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:25:08,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:25:08,559 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:25:08,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:25:08,643 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:25:08,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08 WrapperNode [2023-11-21 22:25:08,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:25:08,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:25:08,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:25:08,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:25:08,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,730 INFO L138 Inliner]: procedures = 32, calls = 39, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 296 [2023-11-21 22:25:08,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:25:08,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:25:08,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:25:08,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:25:08,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,769 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,785 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:25:08,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:25:08,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:25:08,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:25:08,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:25:08,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (1/1) ... [2023-11-21 22:25:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:25:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:08,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:08,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:25:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-21 22:25:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-21 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-21 22:25:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-21 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-21 22:25:08,934 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-21 22:25:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-21 22:25:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-21 22:25:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-21 22:25:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-21 22:25:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-21 22:25:08,936 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-21 22:25:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:25:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-21 22:25:08,937 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-21 22:25:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:25:08,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:25:09,048 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:25:09,052 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:25:09,621 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:25:09,949 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:25:09,949 INFO L308 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-21 22:25:09,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:25:09 BoogieIcfgContainer [2023-11-21 22:25:09,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:25:09,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:25:09,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:25:09,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:25:09,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:25:08" (1/3) ... [2023-11-21 22:25:09,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768805b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:25:09, skipping insertion in model container [2023-11-21 22:25:09,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:08" (2/3) ... [2023-11-21 22:25:09,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768805b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:25:09, skipping insertion in model container [2023-11-21 22:25:09,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:25:09" (3/3) ... [2023-11-21 22:25:09,972 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2023-11-21 22:25:09,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:25:09,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-21 22:25:10,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:25:10,132 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=LoopHeads, 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;@406065b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:25:10,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-21 22:25:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 75 states have internal predecessors, (100), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 22:25:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-21 22:25:10,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:10,170 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] [2023-11-21 22:25:10,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:10,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 683222537, now seen corresponding path program 1 times [2023-11-21 22:25:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615420503] [2023-11-21 22:25:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:10,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615420503] [2023-11-21 22:25:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615420503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:25:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413734400] [2023-11-21 22:25:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:11,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:25:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:25:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:25:11,138 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 75 states have internal predecessors, (100), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-11-21 22:25:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:12,109 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2023-11-21 22:25:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:25:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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 35 [2023-11-21 22:25:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:12,126 INFO L225 Difference]: With dead ends: 267 [2023-11-21 22:25:12,126 INFO L226 Difference]: Without dead ends: 167 [2023-11-21 22:25:12,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:25:12,139 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 243 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:12,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 430 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-21 22:25:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-21 22:25:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2023-11-21 22:25:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 123 states have internal predecessors, (163), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-21 22:25:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2023-11-21 22:25:12,286 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 35 [2023-11-21 22:25:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:12,287 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2023-11-21 22:25:12,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-11-21 22:25:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2023-11-21 22:25:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-21 22:25:12,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:12,292 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] [2023-11-21 22:25:12,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:25:12,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:12,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1613133081, now seen corresponding path program 1 times [2023-11-21 22:25:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589531480] [2023-11-21 22:25:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589531480] [2023-11-21 22:25:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589531480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:25:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681742655] [2023-11-21 22:25:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:25:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:25:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:25:12,669 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-11-21 22:25:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:13,942 INFO L93 Difference]: Finished difference Result 533 states and 744 transitions. [2023-11-21 22:25:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:25:13,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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 36 [2023-11-21 22:25:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:13,958 INFO L225 Difference]: With dead ends: 533 [2023-11-21 22:25:13,959 INFO L226 Difference]: Without dead ends: 376 [2023-11-21 22:25:13,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-21 22:25:13,973 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 339 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:13,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 468 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-21 22:25:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-21 22:25:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2023-11-21 22:25:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 272 states have internal predecessors, (359), 62 states have call successors, (62), 30 states have call predecessors, (62), 30 states have return successors, (79), 58 states have call predecessors, (79), 62 states have call successors, (79) [2023-11-21 22:25:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 500 transitions. [2023-11-21 22:25:14,086 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 500 transitions. Word has length 36 [2023-11-21 22:25:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:14,087 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 500 transitions. [2023-11-21 22:25:14,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-11-21 22:25:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 500 transitions. [2023-11-21 22:25:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-21 22:25:14,090 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:14,090 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] [2023-11-21 22:25:14,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:25:14,091 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:14,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -951799290, now seen corresponding path program 1 times [2023-11-21 22:25:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:14,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960375924] [2023-11-21 22:25:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:14,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960375924] [2023-11-21 22:25:14,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960375924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:25:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967681507] [2023-11-21 22:25:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:25:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:25:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:14,389 INFO L87 Difference]: Start difference. First operand 360 states and 500 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 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) [2023-11-21 22:25:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:15,030 INFO L93 Difference]: Finished difference Result 938 states and 1296 transitions. [2023-11-21 22:25:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:25:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 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 36 [2023-11-21 22:25:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:15,040 INFO L225 Difference]: With dead ends: 938 [2023-11-21 22:25:15,041 INFO L226 Difference]: Without dead ends: 584 [2023-11-21 22:25:15,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-11-21 22:25:15,049 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 376 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:15,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 233 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:25:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-21 22:25:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2023-11-21 22:25:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 426 states have (on average 1.3568075117370892) internal successors, (578), 436 states have internal predecessors, (578), 96 states have call successors, (96), 52 states have call predecessors, (96), 52 states have return successors, (127), 92 states have call predecessors, (127), 96 states have call successors, (127) [2023-11-21 22:25:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 801 transitions. [2023-11-21 22:25:15,161 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 801 transitions. Word has length 36 [2023-11-21 22:25:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:15,161 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 801 transitions. [2023-11-21 22:25:15,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 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) [2023-11-21 22:25:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 801 transitions. [2023-11-21 22:25:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-21 22:25:15,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:15,172 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] [2023-11-21 22:25:15,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:25:15,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:15,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:15,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1130462643, now seen corresponding path program 1 times [2023-11-21 22:25:15,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12070892] [2023-11-21 22:25:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12070892] [2023-11-21 22:25:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12070892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:25:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738037786] [2023-11-21 22:25:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:15,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:25:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:25:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:25:15,333 INFO L87 Difference]: Start difference. First operand 580 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-11-21 22:25:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:15,935 INFO L93 Difference]: Finished difference Result 1673 states and 2340 transitions. [2023-11-21 22:25:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:25:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2023-11-21 22:25:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:15,948 INFO L225 Difference]: With dead ends: 1673 [2023-11-21 22:25:15,949 INFO L226 Difference]: Without dead ends: 1098 [2023-11-21 22:25:15,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:15,961 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 144 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:15,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 251 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:25:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2023-11-21 22:25:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1086. [2023-11-21 22:25:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 799 states have (on average 1.3153942428035044) internal successors, (1051), 813 states have internal predecessors, (1051), 178 states have call successors, (178), 102 states have call predecessors, (178), 103 states have return successors, (233), 171 states have call predecessors, (233), 178 states have call successors, (233) [2023-11-21 22:25:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1462 transitions. [2023-11-21 22:25:16,128 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1462 transitions. Word has length 38 [2023-11-21 22:25:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 1462 transitions. [2023-11-21 22:25:16,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-11-21 22:25:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1462 transitions. [2023-11-21 22:25:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-21 22:25:16,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:16,135 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:25:16,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:16,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -576384355, now seen corresponding path program 1 times [2023-11-21 22:25:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298367021] [2023-11-21 22:25:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:25:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:25:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298367021] [2023-11-21 22:25:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298367021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:25:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782362230] [2023-11-21 22:25:16,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:16,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:25:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:25:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:25:16,339 INFO L87 Difference]: Start difference. First operand 1086 states and 1462 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-21 22:25:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:16,926 INFO L93 Difference]: Finished difference Result 1988 states and 2711 transitions. [2023-11-21 22:25:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:25:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2023-11-21 22:25:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:16,942 INFO L225 Difference]: With dead ends: 1988 [2023-11-21 22:25:16,942 INFO L226 Difference]: Without dead ends: 1414 [2023-11-21 22:25:16,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:16,946 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 90 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:16,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 375 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:25:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-21 22:25:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1209. [2023-11-21 22:25:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 906 states have (on average 1.32560706401766) internal successors, (1201), 920 states have internal predecessors, (1201), 186 states have call successors, (186), 110 states have call predecessors, (186), 111 states have return successors, (241), 179 states have call predecessors, (241), 186 states have call successors, (241) [2023-11-21 22:25:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1628 transitions. [2023-11-21 22:25:17,176 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1628 transitions. Word has length 53 [2023-11-21 22:25:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:17,177 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1628 transitions. [2023-11-21 22:25:17,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-21 22:25:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1628 transitions. [2023-11-21 22:25:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-21 22:25:17,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:17,182 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:17,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:25:17,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:17,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash -99274182, now seen corresponding path program 1 times [2023-11-21 22:25:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163849740] [2023-11-21 22:25:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:25:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:25:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163849740] [2023-11-21 22:25:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163849740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:17,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:17,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:25:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096431167] [2023-11-21 22:25:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:25:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:25:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:17,567 INFO L87 Difference]: Start difference. First operand 1209 states and 1628 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-21 22:25:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:18,414 INFO L93 Difference]: Finished difference Result 2908 states and 3905 transitions. [2023-11-21 22:25:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:25:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2023-11-21 22:25:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:18,430 INFO L225 Difference]: With dead ends: 2908 [2023-11-21 22:25:18,430 INFO L226 Difference]: Without dead ends: 1705 [2023-11-21 22:25:18,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-11-21 22:25:18,436 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 362 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:18,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 327 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:25:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2023-11-21 22:25:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1701. [2023-11-21 22:25:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1265 states have (on average 1.309090909090909) internal successors, (1656), 1283 states have internal predecessors, (1656), 268 states have call successors, (268), 160 states have call predecessors, (268), 162 states have return successors, (347), 258 states have call predecessors, (347), 268 states have call successors, (347) [2023-11-21 22:25:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2271 transitions. [2023-11-21 22:25:18,699 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2271 transitions. Word has length 54 [2023-11-21 22:25:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:18,700 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2271 transitions. [2023-11-21 22:25:18,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-21 22:25:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2271 transitions. [2023-11-21 22:25:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-21 22:25:18,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:18,703 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:18,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:25:18,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:18,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1145855671, now seen corresponding path program 1 times [2023-11-21 22:25:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87723138] [2023-11-21 22:25:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 22:25:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:25:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87723138] [2023-11-21 22:25:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87723138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784973218] [2023-11-21 22:25:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:18,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:18,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:18,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:18,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:25:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:19,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:25:19,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 22:25:19,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784973218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:19,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [7] total 8 [2023-11-21 22:25:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119212097] [2023-11-21 22:25:19,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:25:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:19,247 INFO L87 Difference]: Start difference. First operand 1701 states and 2271 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:25:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:19,485 INFO L93 Difference]: Finished difference Result 1703 states and 2271 transitions. [2023-11-21 22:25:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:19,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (5), 1 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 58 [2023-11-21 22:25:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:19,498 INFO L225 Difference]: With dead ends: 1703 [2023-11-21 22:25:19,498 INFO L226 Difference]: Without dead ends: 1701 [2023-11-21 22:25:19,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:19,500 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:19,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 213 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:25:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2023-11-21 22:25:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1701. [2023-11-21 22:25:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1283 states have internal predecessors, (1651), 268 states have call successors, (268), 160 states have call predecessors, (268), 162 states have return successors, (347), 258 states have call predecessors, (347), 268 states have call successors, (347) [2023-11-21 22:25:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2266 transitions. [2023-11-21 22:25:19,709 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2266 transitions. Word has length 58 [2023-11-21 22:25:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:19,710 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2266 transitions. [2023-11-21 22:25:19,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:25:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2266 transitions. [2023-11-21 22:25:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-21 22:25:19,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:19,712 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:19,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-21 22:25:19,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:19,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1176570879, now seen corresponding path program 1 times [2023-11-21 22:25:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004938687] [2023-11-21 22:25:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-21 22:25:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 22:25:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 22:25:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004938687] [2023-11-21 22:25:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004938687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:25:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201665324] [2023-11-21 22:25:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:20,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:25:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:20,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:25:20,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:25:20,116 INFO L87 Difference]: Start difference. First operand 1701 states and 2266 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 22:25:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:20,814 INFO L93 Difference]: Finished difference Result 3935 states and 5315 transitions. [2023-11-21 22:25:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:25:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-11-21 22:25:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:20,834 INFO L225 Difference]: With dead ends: 3935 [2023-11-21 22:25:20,834 INFO L226 Difference]: Without dead ends: 2466 [2023-11-21 22:25:20,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:20,843 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 137 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:20,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 254 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:25:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2023-11-21 22:25:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2442. [2023-11-21 22:25:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1816 states have (on average 1.2912995594713657) internal successors, (2345), 1837 states have internal predecessors, (2345), 386 states have call successors, (386), 232 states have call predecessors, (386), 234 states have return successors, (486), 373 states have call predecessors, (486), 386 states have call successors, (486) [2023-11-21 22:25:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3217 transitions. [2023-11-21 22:25:21,161 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3217 transitions. Word has length 60 [2023-11-21 22:25:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:21,162 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3217 transitions. [2023-11-21 22:25:21,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 22:25:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3217 transitions. [2023-11-21 22:25:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-21 22:25:21,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:21,164 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:21,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:25:21,165 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:21,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1161787848, now seen corresponding path program 1 times [2023-11-21 22:25:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173582223] [2023-11-21 22:25:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 22:25:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:25:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173582223] [2023-11-21 22:25:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173582223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657421880] [2023-11-21 22:25:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:21,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:21,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:25:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:21,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:25:21,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 22:25:21,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657421880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:21,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [7] total 8 [2023-11-21 22:25:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949489441] [2023-11-21 22:25:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:21,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:25:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:21,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:21,526 INFO L87 Difference]: Start difference. First operand 2442 states and 3217 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:25:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:21,827 INFO L93 Difference]: Finished difference Result 2757 states and 3614 transitions. [2023-11-21 22:25:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (5), 1 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 59 [2023-11-21 22:25:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:21,849 INFO L225 Difference]: With dead ends: 2757 [2023-11-21 22:25:21,849 INFO L226 Difference]: Without dead ends: 2755 [2023-11-21 22:25:21,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:21,852 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:21,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 208 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:25:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2023-11-21 22:25:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2745. [2023-11-21 22:25:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2050 states have (on average 1.2892682926829269) internal successors, (2643), 2071 states have internal predecessors, (2643), 428 states have call successors, (428), 259 states have call predecessors, (428), 261 states have return successors, (528), 415 states have call predecessors, (528), 428 states have call successors, (528) [2023-11-21 22:25:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3599 transitions. [2023-11-21 22:25:22,184 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3599 transitions. Word has length 59 [2023-11-21 22:25:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:22,185 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 3599 transitions. [2023-11-21 22:25:22,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:25:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3599 transitions. [2023-11-21 22:25:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-21 22:25:22,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:22,187 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:22,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:22,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 22:25:22,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:22,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1462633422, now seen corresponding path program 1 times [2023-11-21 22:25:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556448131] [2023-11-21 22:25:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-21 22:25:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 22:25:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 22:25:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 22:25:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556448131] [2023-11-21 22:25:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556448131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:22,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:25:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578606624] [2023-11-21 22:25:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:25:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:25:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:25:22,523 INFO L87 Difference]: Start difference. First operand 2745 states and 3599 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:25:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:23,244 INFO L93 Difference]: Finished difference Result 4938 states and 6559 transitions. [2023-11-21 22:25:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:25:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2023-11-21 22:25:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:23,269 INFO L225 Difference]: With dead ends: 4938 [2023-11-21 22:25:23,269 INFO L226 Difference]: Without dead ends: 2986 [2023-11-21 22:25:23,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:23,277 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 81 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:23,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 327 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:25:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-11-21 22:25:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2867. [2023-11-21 22:25:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2867 states, 2156 states have (on average 1.294526901669759) internal successors, (2791), 2177 states have internal predecessors, (2791), 436 states have call successors, (436), 267 states have call predecessors, (436), 269 states have return successors, (536), 423 states have call predecessors, (536), 436 states have call successors, (536) [2023-11-21 22:25:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 3763 transitions. [2023-11-21 22:25:23,671 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 3763 transitions. Word has length 67 [2023-11-21 22:25:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:23,672 INFO L495 AbstractCegarLoop]: Abstraction has 2867 states and 3763 transitions. [2023-11-21 22:25:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:25:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 3763 transitions. [2023-11-21 22:25:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-21 22:25:23,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:23,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:25:23,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1494180993, now seen corresponding path program 1 times [2023-11-21 22:25:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801454194] [2023-11-21 22:25:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:25:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 22:25:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 22:25:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:25:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:23,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801454194] [2023-11-21 22:25:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801454194] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:23,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142526333] [2023-11-21 22:25:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:23,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:23,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:23,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:23,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:25:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:24,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:25:24,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 22:25:24,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142526333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-21 22:25:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427585710] [2023-11-21 22:25:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:25:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:24,090 INFO L87 Difference]: Start difference. First operand 2867 states and 3763 transitions. Second operand has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 22:25:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:24,461 INFO L93 Difference]: Finished difference Result 2867 states and 3763 transitions. [2023-11-21 22:25:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2023-11-21 22:25:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:24,485 INFO L225 Difference]: With dead ends: 2867 [2023-11-21 22:25:24,486 INFO L226 Difference]: Without dead ends: 2865 [2023-11-21 22:25:24,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:24,489 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:24,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 100 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:25:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2023-11-21 22:25:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2023-11-21 22:25:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2156 states have (on average 1.2843228200371057) internal successors, (2769), 2175 states have internal predecessors, (2769), 436 states have call successors, (436), 267 states have call predecessors, (436), 269 states have return successors, (536), 423 states have call predecessors, (536), 436 states have call successors, (536) [2023-11-21 22:25:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3741 transitions. [2023-11-21 22:25:24,918 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3741 transitions. Word has length 72 [2023-11-21 22:25:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:24,919 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3741 transitions. [2023-11-21 22:25:24,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 22:25:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3741 transitions. [2023-11-21 22:25:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-21 22:25:24,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:24,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:24,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:25,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-21 22:25:25,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:25,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash 925029842, now seen corresponding path program 1 times [2023-11-21 22:25:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537462238] [2023-11-21 22:25:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:25:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 22:25:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 22:25:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:25:25,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537462238] [2023-11-21 22:25:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537462238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656370863] [2023-11-21 22:25:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:25,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:25,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:25:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:25,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:25:25,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:25,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656370863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:25,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-21 22:25:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099100713] [2023-11-21 22:25:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:25,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:25:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:25,567 INFO L87 Difference]: Start difference. First operand 2865 states and 3741 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-21 22:25:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:26,166 INFO L93 Difference]: Finished difference Result 4925 states and 6639 transitions. [2023-11-21 22:25:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:26,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-11-21 22:25:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:26,191 INFO L225 Difference]: With dead ends: 4925 [2023-11-21 22:25:26,192 INFO L226 Difference]: Without dead ends: 2879 [2023-11-21 22:25:26,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:25:26,202 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 90 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:26,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 238 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:25:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2023-11-21 22:25:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2861. [2023-11-21 22:25:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2152 states have (on average 1.2551115241635689) internal successors, (2701), 2171 states have internal predecessors, (2701), 436 states have call successors, (436), 267 states have call predecessors, (436), 269 states have return successors, (536), 423 states have call predecessors, (536), 436 states have call successors, (536) [2023-11-21 22:25:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3673 transitions. [2023-11-21 22:25:26,686 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3673 transitions. Word has length 73 [2023-11-21 22:25:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:26,687 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 3673 transitions. [2023-11-21 22:25:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-21 22:25:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3673 transitions. [2023-11-21 22:25:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-21 22:25:26,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:26,693 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:26,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:26,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:26,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -215321869, now seen corresponding path program 1 times [2023-11-21 22:25:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392483539] [2023-11-21 22:25:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:25:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 22:25:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:25:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 22:25:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 22:25:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:25:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 22:25:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 22:25:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:25:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392483539] [2023-11-21 22:25:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392483539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850802270] [2023-11-21 22:25:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:27,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:27,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:27,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:25:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:27,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 22:25:27,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:25:27,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850802270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2023-11-21 22:25:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302076719] [2023-11-21 22:25:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:27,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:25:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:25:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:25:27,472 INFO L87 Difference]: Start difference. First operand 2861 states and 3673 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:25:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:28,340 INFO L93 Difference]: Finished difference Result 7210 states and 9233 transitions. [2023-11-21 22:25:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:25:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2023-11-21 22:25:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:25:28,374 INFO L225 Difference]: With dead ends: 7210 [2023-11-21 22:25:28,374 INFO L226 Difference]: Without dead ends: 4355 [2023-11-21 22:25:28,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:25:28,386 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 300 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:25:28,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 230 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:25:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2023-11-21 22:25:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4004. [2023-11-21 22:25:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3000 states have (on average 1.231) internal successors, (3693), 3025 states have internal predecessors, (3693), 616 states have call successors, (616), 382 states have call predecessors, (616), 384 states have return successors, (737), 597 states have call predecessors, (737), 616 states have call successors, (737) [2023-11-21 22:25:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 5046 transitions. [2023-11-21 22:25:29,111 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 5046 transitions. Word has length 73 [2023-11-21 22:25:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:25:29,111 INFO L495 AbstractCegarLoop]: Abstraction has 4004 states and 5046 transitions. [2023-11-21 22:25:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:25:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 5046 transitions. [2023-11-21 22:25:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-21 22:25:29,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:25:29,115 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:25:29,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:29,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:29,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-21 22:25:29,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2000371339, now seen corresponding path program 1 times [2023-11-21 22:25:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568125381] [2023-11-21 22:25:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:29,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:29,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:29,424 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:25:29,426 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-21 22:25:29,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-21 22:25:29,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-21 22:25:29,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-21 22:25:29,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-21 22:25:29,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-21 22:25:29,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:25:29,460 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:29,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:25:29,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-21 22:25:29,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-21 22:25:29,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:25:29 BoogieIcfgContainer [2023-11-21 22:25:29,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:25:29,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:25:29,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:25:29,625 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:25:29,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:25:09" (3/4) ... [2023-11-21 22:25:29,632 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 22:25:29,655 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-21 22:25:29,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-21 22:25:29,741 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:25:29,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:25:29,742 INFO L158 Benchmark]: Toolchain (without parser) took 21610.68ms. Allocated memory was 125.8MB in the beginning and 471.9MB in the end (delta: 346.0MB). Free memory was 63.0MB in the beginning and 260.1MB in the end (delta: -197.0MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,742 INFO L158 Benchmark]: CDTParser took 1.60ms. Allocated memory is still 125.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:25:29,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.99ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 62.8MB in the beginning and 125.2MB in the end (delta: -62.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.95ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,744 INFO L158 Benchmark]: Boogie Preprocessor took 107.54ms. Allocated memory is still 161.5MB. Free memory was 122.6MB in the beginning and 119.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,744 INFO L158 Benchmark]: RCFGBuilder took 1113.61ms. Allocated memory is still 161.5MB. Free memory was 119.7MB in the beginning and 74.9MB in the end (delta: 44.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,744 INFO L158 Benchmark]: TraceAbstraction took 19665.83ms. Allocated memory was 161.5MB in the beginning and 471.9MB in the end (delta: 310.4MB). Free memory was 74.3MB in the beginning and 268.5MB in the end (delta: -194.1MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,745 INFO L158 Benchmark]: Witness Printer took 116.27ms. Allocated memory is still 471.9MB. Free memory was 268.5MB in the beginning and 260.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-21 22:25:29,747 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60ms. Allocated memory is still 125.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.99ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 62.8MB in the beginning and 125.2MB in the end (delta: -62.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.95ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.54ms. Allocated memory is still 161.5MB. Free memory was 122.6MB in the beginning and 119.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.61ms. Allocated memory is still 161.5MB. Free memory was 119.7MB in the beginning and 74.9MB in the end (delta: 44.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19665.83ms. Allocated memory was 161.5MB in the beginning and 471.9MB in the end (delta: 310.4MB). Free memory was 74.3MB in the beginning and 268.5MB in the end (delta: -194.1MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Witness Printer took 116.27ms. Allocated memory is still 471.9MB. Free memory was 268.5MB in the beginning and 260.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L303-L314] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE, EXPR \read(tmp_ndt_2) [L322] EXPR t1_st = 1 [L323] CALL, EXPR transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 [L323] RET, EXPR transmit1() [L317-L328] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE, EXPR !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_3=0, token=0] [L331-L342] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE, EXPR \read(tmp_ndt_1) [L308] EXPR m_st = 1 [L309] CALL, EXPR master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L467] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET, EXPR master() [L303-L314] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=2147483647] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 98 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2446 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2349 mSDsluCounter, 3654 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2166 mSDsCounter, 792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2299 IncrementalHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 792 mSolverCounterUnsat, 1488 mSDtfsCounter, 2299 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4004occurred in iteration=13, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 768 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1124 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1488 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 213/244 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! [2023-11-21 22:25:29,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_249382a2-4acc-4f6d-a515-c8f6e9e0f9a9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)