/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:44:15,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:44:15,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:44:15,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:44:15,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:44:15,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:44:15,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:44:15,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:44:15,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:44:15,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:44:15,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:44:15,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:44:15,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:44:15,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:44:15,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:44:15,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:44:15,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:44:15,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:44:15,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:44:15,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:44:15,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:44:15,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:44:15,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:44:15,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:44:15,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:44:15,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:44:15,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:44:15,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:44:15,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:44:15,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:44:15,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:44:15,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:44:15,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:44:15,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:44:15,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:44:15,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:44:15,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:44:15,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:44:15,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:44:15,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:44:15,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:44:15,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:44:15,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:44:15,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:44:15,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:44:15,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:44:15,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:44:15,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:44:15,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:44:15,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:44:15,691 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:44:15,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:44:15,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:44:15,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:44:15,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:44:15,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:44:15,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:44:15,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:44:15,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:44:15,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:44:15,694 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:44:15,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:44:15,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:44:15,695 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:44:15,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:44:15,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:44:15,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:44:15,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:44:15,967 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:44:15,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2022-01-10 06:44:16,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15583a73/34ccc632bb294a77a958d800f86653fb/FLAG12024b878 [2022-01-10 06:44:16,440 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:44:16,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2022-01-10 06:44:16,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15583a73/34ccc632bb294a77a958d800f86653fb/FLAG12024b878 [2022-01-10 06:44:16,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15583a73/34ccc632bb294a77a958d800f86653fb [2022-01-10 06:44:16,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:44:16,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:44:16,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:44:16,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:44:16,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:44:16,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:16" (1/1) ... [2022-01-10 06:44:16,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2c74f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:16, skipping insertion in model container [2022-01-10 06:44:16,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:16" (1/1) ... [2022-01-10 06:44:16,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:44:16,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:44:17,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2022-01-10 06:44:17,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:44:17,206 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:44:17,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2022-01-10 06:44:17,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:44:17,279 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:44:17,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17 WrapperNode [2022-01-10 06:44:17,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:44:17,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:44:17,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:44:17,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:44:17,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,340 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 254 [2022-01-10 06:44:17,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:44:17,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:44:17,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:44:17,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:44:17,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:44:17,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:44:17,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:44:17,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:44:17,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (1/1) ... [2022-01-10 06:44:17,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:44:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:44:17,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:44:17,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:44:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:44:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:44:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-01-10 06:44:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-01-10 06:44:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-01-10 06:44:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-01-10 06:44:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 06:44:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 06:44:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 06:44:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 06:44:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-01-10 06:44:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-01-10 06:44:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-01-10 06:44:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-01-10 06:44:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:44:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:44:17,560 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:44:17,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:44:17,914 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:44:17,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:44:17,921 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 06:44:17,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:17 BoogieIcfgContainer [2022-01-10 06:44:17,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:44:17,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:44:17,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:44:17,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:44:17,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:44:16" (1/3) ... [2022-01-10 06:44:17,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d00709f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:17, skipping insertion in model container [2022-01-10 06:44:17,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:17" (2/3) ... [2022-01-10 06:44:17,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d00709f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:17, skipping insertion in model container [2022-01-10 06:44:17,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:17" (3/3) ... [2022-01-10 06:44:17,930 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-01-10 06:44:17,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:44:17,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:44:17,972 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:44:17,977 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:44:17,978 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:44:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 06:44:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:18,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:18,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:18,001 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-01-10 06:44:18,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:18,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805360765] [2022-01-10 06:44:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:18,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:18,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:18,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:18,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:44:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:18,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:18,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:18,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:18,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805360765] [2022-01-10 06:44:18,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805360765] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:18,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:18,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:18,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349365425] [2022-01-10 06:44:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:18,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:18,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:18,448 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:18,524 INFO L93 Difference]: Finished difference Result 247 states and 375 transitions. [2022-01-10 06:44:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:18,526 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:18,534 INFO L225 Difference]: With dead ends: 247 [2022-01-10 06:44:18,534 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 06:44:18,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:18,545 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:18,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 178 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 06:44:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-01-10 06:44:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 06:44:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-01-10 06:44:18,611 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-01-10 06:44:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:18,612 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-01-10 06:44:18,613 INFO L471 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-01-10 06:44:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:18,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:18,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:18,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:18,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:18,828 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-01-10 06:44:18,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919434434] [2022-01-10 06:44:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:18,830 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:18,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:44:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:18,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:18,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:19,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:19,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:19,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919434434] [2022-01-10 06:44:19,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919434434] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:19,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:19,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:19,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869335654] [2022-01-10 06:44:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:19,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:19,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:19,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:19,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:19,087 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:19,400 INFO L93 Difference]: Finished difference Result 355 states and 516 transitions. [2022-01-10 06:44:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:44:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:19,412 INFO L225 Difference]: With dead ends: 355 [2022-01-10 06:44:19,412 INFO L226 Difference]: Without dead ends: 242 [2022-01-10 06:44:19,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:44:19,414 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 277 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:19,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 498 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:44:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-01-10 06:44:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2022-01-10 06:44:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-01-10 06:44:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-01-10 06:44:19,435 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-01-10 06:44:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:19,436 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-01-10 06:44:19,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-01-10 06:44:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:19,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:19,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:19,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:19,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:19,644 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-01-10 06:44:19,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:19,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605456852] [2022-01-10 06:44:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:19,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:19,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:19,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:44:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:19,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:19,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:19,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:19,870 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605456852] [2022-01-10 06:44:19,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605456852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:19,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:19,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:19,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5934330] [2022-01-10 06:44:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:19,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:19,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:19,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:19,872 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:20,018 INFO L93 Difference]: Finished difference Result 456 states and 655 transitions. [2022-01-10 06:44:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:44:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:20,022 INFO L225 Difference]: With dead ends: 456 [2022-01-10 06:44:20,022 INFO L226 Difference]: Without dead ends: 233 [2022-01-10 06:44:20,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:44:20,026 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 207 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:20,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 329 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:44:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-01-10 06:44:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-01-10 06:44:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.407216494845361) internal successors, (273), 196 states have internal predecessors, (273), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-01-10 06:44:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 324 transitions. [2022-01-10 06:44:20,069 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 324 transitions. Word has length 67 [2022-01-10 06:44:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:20,069 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 324 transitions. [2022-01-10 06:44:20,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 324 transitions. [2022-01-10 06:44:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:20,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:20,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:20,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:20,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:20,288 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1515436166, now seen corresponding path program 1 times [2022-01-10 06:44:20,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:20,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866699498] [2022-01-10 06:44:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:20,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:20,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:20,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:44:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:20,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:20,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:20,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:20,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866699498] [2022-01-10 06:44:20,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866699498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:20,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:20,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:20,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544121356] [2022-01-10 06:44:20,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:20,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:20,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:20,516 INFO L87 Difference]: Start difference. First operand 233 states and 324 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:20,658 INFO L93 Difference]: Finished difference Result 456 states and 641 transitions. [2022-01-10 06:44:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:44:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:20,660 INFO L225 Difference]: With dead ends: 456 [2022-01-10 06:44:20,660 INFO L226 Difference]: Without dead ends: 233 [2022-01-10 06:44:20,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:44:20,662 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 201 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:20,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 322 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:44:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-01-10 06:44:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-01-10 06:44:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.3711340206185567) internal successors, (266), 196 states have internal predecessors, (266), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-01-10 06:44:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2022-01-10 06:44:20,677 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 67 [2022-01-10 06:44:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:20,678 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2022-01-10 06:44:20,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2022-01-10 06:44:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:20,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:20,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:20,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:20,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:20,888 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1205548998, now seen corresponding path program 1 times [2022-01-10 06:44:20,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:20,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647695542] [2022-01-10 06:44:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:20,890 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:20,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:44:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:20,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:20,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:21,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:21,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647695542] [2022-01-10 06:44:21,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647695542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:21,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:21,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:21,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240236203] [2022-01-10 06:44:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:21,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:21,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:21,082 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:21,272 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2022-01-10 06:44:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:44:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:21,275 INFO L225 Difference]: With dead ends: 508 [2022-01-10 06:44:21,275 INFO L226 Difference]: Without dead ends: 285 [2022-01-10 06:44:21,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:44:21,277 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 220 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:21,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 314 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:44:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-10 06:44:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-01-10 06:44:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 240 states have (on average 1.3333333333333333) internal successors, (320), 242 states have internal predecessors, (320), 27 states have call successors, (27), 16 states have call predecessors, (27), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 06:44:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 375 transitions. [2022-01-10 06:44:21,293 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 375 transitions. Word has length 67 [2022-01-10 06:44:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:21,293 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 375 transitions. [2022-01-10 06:44:21,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 375 transitions. [2022-01-10 06:44:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:21,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:21,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:21,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:21,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:21,506 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -348963367, now seen corresponding path program 1 times [2022-01-10 06:44:21,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:21,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44851089] [2022-01-10 06:44:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:21,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:21,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:21,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:44:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:21,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:21,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:21,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:21,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44851089] [2022-01-10 06:44:21,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44851089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:21,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:21,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:44:21,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626712280] [2022-01-10 06:44:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:21,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:21,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:21,678 INFO L87 Difference]: Start difference. First operand 285 states and 375 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:21,720 INFO L93 Difference]: Finished difference Result 629 states and 844 transitions. [2022-01-10 06:44:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:44:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:21,723 INFO L225 Difference]: With dead ends: 629 [2022-01-10 06:44:21,723 INFO L226 Difference]: Without dead ends: 355 [2022-01-10 06:44:21,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:44:21,724 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 90 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:21,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 699 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-10 06:44:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 291. [2022-01-10 06:44:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 246 states have (on average 1.3170731707317074) internal successors, (324), 248 states have internal predecessors, (324), 27 states have call successors, (27), 16 states have call predecessors, (27), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 06:44:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 379 transitions. [2022-01-10 06:44:21,743 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 379 transitions. Word has length 67 [2022-01-10 06:44:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:21,743 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 379 transitions. [2022-01-10 06:44:21,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 379 transitions. [2022-01-10 06:44:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:21,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:21,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:21,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:21,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:21,953 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash -100816873, now seen corresponding path program 1 times [2022-01-10 06:44:21,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177354767] [2022-01-10 06:44:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:21,955 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:21,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:21,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:44:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:22,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:22,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:22,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:22,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177354767] [2022-01-10 06:44:22,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177354767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:22,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:22,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:44:22,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90171227] [2022-01-10 06:44:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:22,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:22,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:22,103 INFO L87 Difference]: Start difference. First operand 291 states and 379 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:22,146 INFO L93 Difference]: Finished difference Result 655 states and 870 transitions. [2022-01-10 06:44:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:44:22,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:22,149 INFO L225 Difference]: With dead ends: 655 [2022-01-10 06:44:22,149 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 06:44:22,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:44:22,153 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:22,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 671 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 06:44:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2022-01-10 06:44:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 258 states have (on average 1.302325581395349) internal successors, (336), 260 states have internal predecessors, (336), 27 states have call successors, (27), 16 states have call predecessors, (27), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 06:44:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 391 transitions. [2022-01-10 06:44:22,177 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 391 transitions. Word has length 67 [2022-01-10 06:44:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:22,177 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 391 transitions. [2022-01-10 06:44:22,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 391 transitions. [2022-01-10 06:44:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:22,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:22,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:22,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:22,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:22,394 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -495183659, now seen corresponding path program 1 times [2022-01-10 06:44:22,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518462580] [2022-01-10 06:44:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:22,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:22,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:22,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:22,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:44:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:22,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:22,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:22,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:22,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:22,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518462580] [2022-01-10 06:44:22,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518462580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:22,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:22,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:44:22,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482470267] [2022-01-10 06:44:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:22,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:44:22,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:44:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:22,545 INFO L87 Difference]: Start difference. First operand 303 states and 391 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:22,581 INFO L93 Difference]: Finished difference Result 609 states and 794 transitions. [2022-01-10 06:44:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:44:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:22,583 INFO L225 Difference]: With dead ends: 609 [2022-01-10 06:44:22,583 INFO L226 Difference]: Without dead ends: 317 [2022-01-10 06:44:22,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:44:22,585 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 10 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:22,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 659 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-01-10 06:44:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 309. [2022-01-10 06:44:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 264 states have (on average 1.2878787878787878) internal successors, (340), 266 states have internal predecessors, (340), 27 states have call successors, (27), 16 states have call predecessors, (27), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 06:44:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 395 transitions. [2022-01-10 06:44:22,602 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 395 transitions. Word has length 67 [2022-01-10 06:44:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:22,602 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 395 transitions. [2022-01-10 06:44:22,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 395 transitions. [2022-01-10 06:44:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 06:44:22,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:22,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:22,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:22,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:22,813 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -472551405, now seen corresponding path program 1 times [2022-01-10 06:44:22,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622150185] [2022-01-10 06:44:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:22,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:22,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:22,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:22,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:44:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:22,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:22,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:22,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622150185] [2022-01-10 06:44:22,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622150185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:22,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:22,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:22,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578814362] [2022-01-10 06:44:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:22,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:44:22,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:44:22,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:44:22,992 INFO L87 Difference]: Start difference. First operand 309 states and 395 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:23,172 INFO L93 Difference]: Finished difference Result 927 states and 1189 transitions. [2022-01-10 06:44:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:44:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 06:44:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:23,176 INFO L225 Difference]: With dead ends: 927 [2022-01-10 06:44:23,176 INFO L226 Difference]: Without dead ends: 630 [2022-01-10 06:44:23,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:23,178 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 201 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:23,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 383 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:44:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-01-10 06:44:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 622. [2022-01-10 06:44:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 537 states have (on average 1.2737430167597765) internal successors, (684), 543 states have internal predecessors, (684), 49 states have call successors, (49), 30 states have call predecessors, (49), 35 states have return successors, (62), 50 states have call predecessors, (62), 49 states have call successors, (62) [2022-01-10 06:44:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 795 transitions. [2022-01-10 06:44:23,212 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 795 transitions. Word has length 67 [2022-01-10 06:44:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:23,212 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 795 transitions. [2022-01-10 06:44:23,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 795 transitions. [2022-01-10 06:44:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 06:44:23,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:23,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:23,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:23,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:23,425 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -241037013, now seen corresponding path program 1 times [2022-01-10 06:44:23,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:23,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789748706] [2022-01-10 06:44:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:23,426 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:23,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:23,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:23,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:44:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:23,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:44:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:23,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:23,604 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789748706] [2022-01-10 06:44:23,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789748706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:23,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:23,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:44:23,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515998889] [2022-01-10 06:44:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:23,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:44:23,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:44:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:44:23,605 INFO L87 Difference]: Start difference. First operand 622 states and 795 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:23,781 INFO L93 Difference]: Finished difference Result 1775 states and 2268 transitions. [2022-01-10 06:44:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:44:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-10 06:44:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:23,788 INFO L225 Difference]: With dead ends: 1775 [2022-01-10 06:44:23,788 INFO L226 Difference]: Without dead ends: 1171 [2022-01-10 06:44:23,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:44:23,791 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 188 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:23,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 447 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:44:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-01-10 06:44:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1086. [2022-01-10 06:44:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 929 states have (on average 1.256189451022605) internal successors, (1167), 945 states have internal predecessors, (1167), 89 states have call successors, (89), 52 states have call predecessors, (89), 67 states have return successors, (134), 92 states have call predecessors, (134), 89 states have call successors, (134) [2022-01-10 06:44:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1390 transitions. [2022-01-10 06:44:23,859 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1390 transitions. Word has length 68 [2022-01-10 06:44:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:23,859 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1390 transitions. [2022-01-10 06:44:23,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1390 transitions. [2022-01-10 06:44:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 06:44:23,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:23,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:23,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:24,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:24,071 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -39213079, now seen corresponding path program 1 times [2022-01-10 06:44:24,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525928292] [2022-01-10 06:44:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:24,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:24,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:24,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:44:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:24,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:24,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:24,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:24,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525928292] [2022-01-10 06:44:24,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525928292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:24,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:24,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:24,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264791995] [2022-01-10 06:44:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:24,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:24,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:24,225 INFO L87 Difference]: Start difference. First operand 1086 states and 1390 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:24,276 INFO L93 Difference]: Finished difference Result 2146 states and 2738 transitions. [2022-01-10 06:44:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 2 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 68 [2022-01-10 06:44:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:24,282 INFO L225 Difference]: With dead ends: 2146 [2022-01-10 06:44:24,282 INFO L226 Difference]: Without dead ends: 1076 [2022-01-10 06:44:24,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:24,285 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:24,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 164 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-01-10 06:44:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2022-01-10 06:44:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 925 states have (on average 1.2551351351351352) internal successors, (1161), 939 states have internal predecessors, (1161), 83 states have call successors, (83), 52 states have call predecessors, (83), 67 states have return successors, (126), 86 states have call predecessors, (126), 83 states have call successors, (126) [2022-01-10 06:44:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1370 transitions. [2022-01-10 06:44:24,339 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1370 transitions. Word has length 68 [2022-01-10 06:44:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:24,340 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1370 transitions. [2022-01-10 06:44:24,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:44:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1370 transitions. [2022-01-10 06:44:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 06:44:24,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:24,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:24,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:24,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:24,554 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1602304156, now seen corresponding path program 1 times [2022-01-10 06:44:24,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:24,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729936276] [2022-01-10 06:44:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:24,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:24,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:24,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:24,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:44:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:24,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:24,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:24,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:24,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:24,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729936276] [2022-01-10 06:44:24,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729936276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:24,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:24,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:44:24,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594210055] [2022-01-10 06:44:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:24,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:24,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:24,736 INFO L87 Difference]: Start difference. First operand 1076 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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) [2022-01-10 06:44:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:24,858 INFO L93 Difference]: Finished difference Result 3140 states and 4042 transitions. [2022-01-10 06:44:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 69 [2022-01-10 06:44:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:24,869 INFO L225 Difference]: With dead ends: 3140 [2022-01-10 06:44:24,869 INFO L226 Difference]: Without dead ends: 2080 [2022-01-10 06:44:24,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:24,873 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 89 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:24,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 315 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-01-10 06:44:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2064. [2022-01-10 06:44:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1770 states have (on average 1.2401129943502824) internal successors, (2195), 1796 states have internal predecessors, (2195), 159 states have call successors, (159), 104 states have call predecessors, (159), 134 states have return successors, (245), 165 states have call predecessors, (245), 159 states have call successors, (245) [2022-01-10 06:44:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2599 transitions. [2022-01-10 06:44:24,980 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2599 transitions. Word has length 69 [2022-01-10 06:44:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:24,980 INFO L470 AbstractCegarLoop]: Abstraction has 2064 states and 2599 transitions. [2022-01-10 06:44:24,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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) [2022-01-10 06:44:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2599 transitions. [2022-01-10 06:44:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 06:44:24,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:24,982 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:24,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:25,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:25,191 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 721718035, now seen corresponding path program 1 times [2022-01-10 06:44:25,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:25,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311711390] [2022-01-10 06:44:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:25,192 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:25,193 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:25,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 06:44:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:25,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:25,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:25,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:25,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:25,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311711390] [2022-01-10 06:44:25,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311711390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:25,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:25,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:25,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720546213] [2022-01-10 06:44:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:25,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:25,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:25,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:25,374 INFO L87 Difference]: Start difference. First operand 2064 states and 2599 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 06:44:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:25,509 INFO L93 Difference]: Finished difference Result 4129 states and 5229 transitions. [2022-01-10 06:44:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2022-01-10 06:44:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:25,521 INFO L225 Difference]: With dead ends: 4129 [2022-01-10 06:44:25,521 INFO L226 Difference]: Without dead ends: 3071 [2022-01-10 06:44:25,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:25,524 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 121 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:25,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 452 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2022-01-10 06:44:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2022-01-10 06:44:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2634 states have (on average 1.237661351556568) internal successors, (3260), 2672 states have internal predecessors, (3260), 235 states have call successors, (235), 156 states have call predecessors, (235), 201 states have return successors, (374), 244 states have call predecessors, (374), 235 states have call successors, (374) [2022-01-10 06:44:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3869 transitions. [2022-01-10 06:44:25,656 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3869 transitions. Word has length 88 [2022-01-10 06:44:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:25,656 INFO L470 AbstractCegarLoop]: Abstraction has 3071 states and 3869 transitions. [2022-01-10 06:44:25,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 06:44:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3869 transitions. [2022-01-10 06:44:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 06:44:25,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:25,659 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:25,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:25,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:25,868 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash 935655023, now seen corresponding path program 1 times [2022-01-10 06:44:25,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:25,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273483438] [2022-01-10 06:44:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:25,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:25,871 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:25,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 06:44:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:25,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:25,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:44:26,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:26,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:26,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273483438] [2022-01-10 06:44:26,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273483438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:26,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:26,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:44:26,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599001817] [2022-01-10 06:44:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:26,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:26,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:26,130 INFO L87 Difference]: Start difference. First operand 3071 states and 3869 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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) [2022-01-10 06:44:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:26,298 INFO L93 Difference]: Finished difference Result 6903 states and 8700 transitions. [2022-01-10 06:44:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 119 [2022-01-10 06:44:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:26,316 INFO L225 Difference]: With dead ends: 6903 [2022-01-10 06:44:26,316 INFO L226 Difference]: Without dead ends: 3848 [2022-01-10 06:44:26,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:26,325 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 71 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:26,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 345 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2022-01-10 06:44:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3824. [2022-01-10 06:44:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3269 states have (on average 1.2285102477821963) internal successors, (4016), 3313 states have internal predecessors, (4016), 303 states have call successors, (303), 200 states have call predecessors, (303), 251 states have return successors, (464), 312 states have call predecessors, (464), 303 states have call successors, (464) [2022-01-10 06:44:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4783 transitions. [2022-01-10 06:44:26,523 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4783 transitions. Word has length 119 [2022-01-10 06:44:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:26,524 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 4783 transitions. [2022-01-10 06:44:26,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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) [2022-01-10 06:44:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4783 transitions. [2022-01-10 06:44:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 06:44:26,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:26,529 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-01-10 06:44:26,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:26,738 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1170571096, now seen corresponding path program 1 times [2022-01-10 06:44:26,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185111451] [2022-01-10 06:44:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:26,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:26,740 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:26,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 06:44:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:26,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:44:26,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:26,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:26,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185111451] [2022-01-10 06:44:26,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185111451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:26,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:26,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:26,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645382685] [2022-01-10 06:44:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:26,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:26,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:26,964 INFO L87 Difference]: Start difference. First operand 3824 states and 4783 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 06:44:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:27,129 INFO L93 Difference]: Finished difference Result 6880 states and 8628 transitions. [2022-01-10 06:44:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 123 [2022-01-10 06:44:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:27,144 INFO L225 Difference]: With dead ends: 6880 [2022-01-10 06:44:27,144 INFO L226 Difference]: Without dead ends: 3827 [2022-01-10 06:44:27,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:27,151 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 113 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:27,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-01-10 06:44:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3824. [2022-01-10 06:44:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3269 states have (on average 1.2230039767513001) internal successors, (3998), 3313 states have internal predecessors, (3998), 303 states have call successors, (303), 200 states have call predecessors, (303), 251 states have return successors, (446), 312 states have call predecessors, (446), 303 states have call successors, (446) [2022-01-10 06:44:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4747 transitions. [2022-01-10 06:44:27,328 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4747 transitions. Word has length 123 [2022-01-10 06:44:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:27,329 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 4747 transitions. [2022-01-10 06:44:27,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 06:44:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4747 transitions. [2022-01-10 06:44:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 06:44:27,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:27,334 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:27,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:27,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:27,550 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2022-01-10 06:44:27,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957308373] [2022-01-10 06:44:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:27,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:27,552 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:27,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 06:44:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:27,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:27,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 06:44:27,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:27,833 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:27,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957308373] [2022-01-10 06:44:27,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957308373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:27,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:27,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:27,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728222650] [2022-01-10 06:44:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:27,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:27,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:27,835 INFO L87 Difference]: Start difference. First operand 3824 states and 4747 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:28,069 INFO L93 Difference]: Finished difference Result 8590 states and 10924 transitions. [2022-01-10 06:44:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:28,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 154 [2022-01-10 06:44:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:28,092 INFO L225 Difference]: With dead ends: 8590 [2022-01-10 06:44:28,092 INFO L226 Difference]: Without dead ends: 4820 [2022-01-10 06:44:28,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:28,104 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 124 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:28,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 315 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2022-01-10 06:44:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4820. [2022-01-10 06:44:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4820 states, 4122 states have (on average 1.2171276079573023) internal successors, (5017), 4178 states have internal predecessors, (5017), 379 states have call successors, (379), 252 states have call predecessors, (379), 318 states have return successors, (608), 391 states have call predecessors, (608), 379 states have call successors, (608) [2022-01-10 06:44:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 6004 transitions. [2022-01-10 06:44:28,371 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 6004 transitions. Word has length 154 [2022-01-10 06:44:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:28,371 INFO L470 AbstractCegarLoop]: Abstraction has 4820 states and 6004 transitions. [2022-01-10 06:44:28,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 6004 transitions. [2022-01-10 06:44:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-10 06:44:28,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:28,378 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:28,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:28,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:28,588 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2022-01-10 06:44:28,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:28,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43505680] [2022-01-10 06:44:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:28,589 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:28,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:28,590 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:28,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 06:44:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:28,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:28,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 06:44:28,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:28,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:28,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43505680] [2022-01-10 06:44:28,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43505680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:28,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:28,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:28,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803112610] [2022-01-10 06:44:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:28,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:28,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:28,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:28,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:28,864 INFO L87 Difference]: Start difference. First operand 4820 states and 6004 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:29,202 INFO L93 Difference]: Finished difference Result 13887 states and 17632 transitions. [2022-01-10 06:44:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 155 [2022-01-10 06:44:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:29,246 INFO L225 Difference]: With dead ends: 13887 [2022-01-10 06:44:29,246 INFO L226 Difference]: Without dead ends: 9085 [2022-01-10 06:44:29,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:29,264 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 137 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:29,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 424 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2022-01-10 06:44:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8966. [2022-01-10 06:44:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8966 states, 7666 states have (on average 1.2078006783198538) internal successors, (9259), 7758 states have internal predecessors, (9259), 713 states have call successors, (713), 484 states have call predecessors, (713), 586 states have return successors, (1312), 727 states have call predecessors, (1312), 713 states have call successors, (1312) [2022-01-10 06:44:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 11284 transitions. [2022-01-10 06:44:29,719 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 11284 transitions. Word has length 155 [2022-01-10 06:44:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:29,720 INFO L470 AbstractCegarLoop]: Abstraction has 8966 states and 11284 transitions. [2022-01-10 06:44:29,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 11284 transitions. [2022-01-10 06:44:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 06:44:29,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:29,730 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:29,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:29,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:29,943 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2022-01-10 06:44:29,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941224240] [2022-01-10 06:44:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:29,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:29,945 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:29,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 06:44:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:44:30,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:30,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:44:30,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:30,222 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941224240] [2022-01-10 06:44:30,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941224240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:30,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:30,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:30,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760180997] [2022-01-10 06:44:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:30,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:30,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:30,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:30,224 INFO L87 Difference]: Start difference. First operand 8966 states and 11284 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 06:44:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:30,541 INFO L93 Difference]: Finished difference Result 16527 states and 21309 transitions. [2022-01-10 06:44:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-01-10 06:44:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:30,583 INFO L225 Difference]: With dead ends: 16527 [2022-01-10 06:44:30,583 INFO L226 Difference]: Without dead ends: 8998 [2022-01-10 06:44:30,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:30,609 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 86 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:30,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 392 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:44:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2022-01-10 06:44:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 8966. [2022-01-10 06:44:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8966 states, 7666 states have (on average 1.1853639446908426) internal successors, (9087), 7758 states have internal predecessors, (9087), 713 states have call successors, (713), 484 states have call predecessors, (713), 586 states have return successors, (1312), 727 states have call predecessors, (1312), 713 states have call successors, (1312) [2022-01-10 06:44:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 11112 transitions. [2022-01-10 06:44:31,109 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 11112 transitions. Word has length 156 [2022-01-10 06:44:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:31,109 INFO L470 AbstractCegarLoop]: Abstraction has 8966 states and 11112 transitions. [2022-01-10 06:44:31,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 06:44:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 11112 transitions. [2022-01-10 06:44:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 06:44:31,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:31,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:31,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:31,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:31,331 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2022-01-10 06:44:31,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124629682] [2022-01-10 06:44:31,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:44:31,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:31,333 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:31,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 06:44:31,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:44:31,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:44:31,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:44:31,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:44:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 06:44:31,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:44:31,655 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:44:31,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124629682] [2022-01-10 06:44:31,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124629682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:44:31,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:44:31,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:44:31,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691569559] [2022-01-10 06:44:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:44:31,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:44:31,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:44:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:44:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:31,658 INFO L87 Difference]: Start difference. First operand 8966 states and 11112 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:44:32,003 INFO L93 Difference]: Finished difference Result 14174 states and 17602 transitions. [2022-01-10 06:44:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:44:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 156 [2022-01-10 06:44:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:44:32,019 INFO L225 Difference]: With dead ends: 14174 [2022-01-10 06:44:32,020 INFO L226 Difference]: Without dead ends: 2832 [2022-01-10 06:44:32,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:44:32,052 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 135 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:44:32,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 196 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:44:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2022-01-10 06:44:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2723. [2022-01-10 06:44:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2314 states have (on average 1.1041486603284356) internal successors, (2555), 2334 states have internal predecessors, (2555), 233 states have call successors, (233), 156 states have call predecessors, (233), 175 states have return successors, (297), 234 states have call predecessors, (297), 233 states have call successors, (297) [2022-01-10 06:44:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3085 transitions. [2022-01-10 06:44:32,202 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3085 transitions. Word has length 156 [2022-01-10 06:44:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:44:32,203 INFO L470 AbstractCegarLoop]: Abstraction has 2723 states and 3085 transitions. [2022-01-10 06:44:32,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 06:44:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3085 transitions. [2022-01-10 06:44:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 06:44:32,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:44:32,208 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:32,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:32,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:32,418 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:44:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:44:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2022-01-10 06:44:32,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:44:32,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812648070] [2022-01-10 06:44:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:44:32,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:44:32,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:44:32,420 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:44:32,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 06:44:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:44:32,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:44:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:44:32,715 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:44:32,715 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:44:32,716 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:44:32,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 06:44:32,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:44:32,929 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:44:32,933 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:44:33,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:44:33 BoogieIcfgContainer [2022-01-10 06:44:33,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:44:33,068 INFO L158 Benchmark]: Toolchain (without parser) took 16235.58ms. Allocated memory was 181.4MB in the beginning and 813.7MB in the end (delta: 632.3MB). Free memory was 123.4MB in the beginning and 427.1MB in the end (delta: -303.7MB). Peak memory consumption was 329.8MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,070 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:44:33,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.56ms. Allocated memory was 181.4MB in the beginning and 234.9MB in the end (delta: 53.5MB). Free memory was 123.1MB in the beginning and 204.7MB in the end (delta: -81.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.80ms. Allocated memory is still 234.9MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,071 INFO L158 Benchmark]: Boogie Preprocessor took 37.58ms. Allocated memory is still 234.9MB. Free memory was 202.6MB in the beginning and 201.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,071 INFO L158 Benchmark]: RCFGBuilder took 542.31ms. Allocated memory is still 234.9MB. Free memory was 201.1MB in the beginning and 182.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,074 INFO L158 Benchmark]: TraceAbstraction took 15143.54ms. Allocated memory was 234.9MB in the beginning and 813.7MB in the end (delta: 578.8MB). Free memory was 182.2MB in the beginning and 427.1MB in the end (delta: -244.9MB). Peak memory consumption was 335.5MB. Max. memory is 8.0GB. [2022-01-10 06:44:33,077 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.56ms. Allocated memory was 181.4MB in the beginning and 234.9MB in the end (delta: 53.5MB). Free memory was 123.1MB in the beginning and 204.7MB in the end (delta: -81.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.80ms. Allocated memory is still 234.9MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.58ms. Allocated memory is still 234.9MB. Free memory was 202.6MB in the beginning and 201.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 542.31ms. Allocated memory is still 234.9MB. Free memory was 201.1MB in the beginning and 182.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 15143.54ms. Allocated memory was 234.9MB in the beginning and 813.7MB in the end (delta: 578.8MB). Free memory was 182.2MB in the beginning and 427.1MB in the end (delta: -244.9MB). Peak memory consumption was 335.5MB. Max. memory is 8.0GB. * 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2695 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2647 mSDsluCounter, 7536 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3859 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 3677 mSDtfsCounter, 879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1754 GetRequests, 1707 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8966occurred in iteration=17, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 549 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1916 NumberOfCodeBlocks, 1916 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1740 ConstructedInterpolants, 0 QuantifiedInterpolants, 2795 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3296 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 409/409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 06:44:33,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...