/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:19:10,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:19:10,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:19:10,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:19:10,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:19:10,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:19:10,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:19:10,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:19:10,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:19:10,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:19:10,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:19:10,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:19:10,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:19:10,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:19:10,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:19:10,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:19:10,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:19:10,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:19:10,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:19:10,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:19:10,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:19:10,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:19:10,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:19:10,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:19:10,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:19:10,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:19:10,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:19:10,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:19:10,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:19:10,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:19:10,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:19:10,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:19:10,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:19:10,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:19:10,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:19:10,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:19:10,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:19:10,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:19:10,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:19:10,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:19:10,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:19:10,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:19:11,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:19:11,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:19:11,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:19:11,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:19:11,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:19:11,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:19:11,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:19:11,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:19:11,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:19:11,023 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:19:11,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:19:11,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:11,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:19:11,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:19:11,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:19:11,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:19:11,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:19:11,026 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:19:11,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:19:11,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:19:11,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:19:11,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:19:11,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:19:11,028 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 00:19:11,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:19:11,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:19:11,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:19:11,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:19:11,270 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:19:11,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2022-01-11 00:19:11,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c28186/eb2e507694404b9fb3ccf9287a10aba2/FLAG2a43264f7 [2022-01-11 00:19:11,683 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:19:11,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2022-01-11 00:19:11,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c28186/eb2e507694404b9fb3ccf9287a10aba2/FLAG2a43264f7 [2022-01-11 00:19:11,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c28186/eb2e507694404b9fb3ccf9287a10aba2 [2022-01-11 00:19:11,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:19:11,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:19:11,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:11,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:19:11,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:19:11,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:11,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6457001e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11, skipping insertion in model container [2022-01-11 00:19:11,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:11,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:19:11,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:19:11,874 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.03.cil.c[706,719] [2022-01-11 00:19:11,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:11,952 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:19:11,960 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.03.cil.c[706,719] [2022-01-11 00:19:11,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:11,997 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:19:11,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11 WrapperNode [2022-01-11 00:19:11,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:11,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:11,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:19:11,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:19:12,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,048 INFO L137 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 34, calls inlined = 56, statements flattened = 733 [2022-01-11 00:19:12,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:12,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:19:12,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:19:12,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:19:12,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:19:12,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:19:12,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:19:12,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:19:12,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (1/1) ... [2022-01-11 00:19:12,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:19:12,137 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-11 00:19:12,144 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-11 00:19:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:19:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:19:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:19:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:19:12,236 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:19:12,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:19:12,833 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:19:12,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:19:12,842 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-11 00:19:12,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:12 BoogieIcfgContainer [2022-01-11 00:19:12,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:19:12,845 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:19:12,845 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:19:12,848 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:19:12,851 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:12" (1/1) ... [2022-01-11 00:19:13,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:13 BasicIcfg [2022-01-11 00:19:13,059 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:19:13,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:19:13,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:19:13,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:19:13,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:19:11" (1/4) ... [2022-01-11 00:19:13,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684cd98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:13, skipping insertion in model container [2022-01-11 00:19:13,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:11" (2/4) ... [2022-01-11 00:19:13,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684cd98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:13, skipping insertion in model container [2022-01-11 00:19:13,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:12" (3/4) ... [2022-01-11 00:19:13,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684cd98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:19:13, skipping insertion in model container [2022-01-11 00:19:13,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:13" (4/4) ... [2022-01-11 00:19:13,071 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.cTransformedIcfg [2022-01-11 00:19:13,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:19:13,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:19:13,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:19:13,127 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-11 00:19:13,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:19:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 290 states have (on average 1.5448275862068965) internal successors, (448), 291 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:13,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:13,151 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] [2022-01-11 00:19:13,151 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2040191189, now seen corresponding path program 1 times [2022-01-11 00:19:13,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:13,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869801344] [2022-01-11 00:19:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:13,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:13,415 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-11 00:19:13,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:13,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869801344] [2022-01-11 00:19:13,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869801344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:13,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:13,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:13,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214064325] [2022-01-11 00:19:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:13,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:13,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:13,459 INFO L87 Difference]: Start difference. First operand has 292 states, 290 states have (on average 1.5448275862068965) internal successors, (448), 291 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:13,627 INFO L93 Difference]: Finished difference Result 781 states and 1201 transitions. [2022-01-11 00:19:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:13,656 INFO L225 Difference]: With dead ends: 781 [2022-01-11 00:19:13,657 INFO L226 Difference]: Without dead ends: 491 [2022-01-11 00:19:13,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:13,669 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 370 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:13,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 752 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-01-11 00:19:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488. [2022-01-11 00:19:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4763860369609856) internal successors, (719), 487 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 719 transitions. [2022-01-11 00:19:13,761 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 719 transitions. Word has length 66 [2022-01-11 00:19:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:13,762 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 719 transitions. [2022-01-11 00:19:13,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 719 transitions. [2022-01-11 00:19:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:13,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:13,764 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] [2022-01-11 00:19:13,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:19:13,765 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1555539220, now seen corresponding path program 1 times [2022-01-11 00:19:13,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648435377] [2022-01-11 00:19:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:13,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:13,841 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-11 00:19:13,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:13,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648435377] [2022-01-11 00:19:13,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648435377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:13,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:13,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:13,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825325533] [2022-01-11 00:19:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:13,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:13,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:13,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:13,847 INFO L87 Difference]: Start difference. First operand 488 states and 719 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:13,892 INFO L93 Difference]: Finished difference Result 965 states and 1422 transitions. [2022-01-11 00:19:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:13,895 INFO L225 Difference]: With dead ends: 965 [2022-01-11 00:19:13,895 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:13,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:13,902 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 410 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:13,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.459958932238193) internal successors, (711), 487 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 711 transitions. [2022-01-11 00:19:13,935 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 711 transitions. Word has length 66 [2022-01-11 00:19:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:13,935 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 711 transitions. [2022-01-11 00:19:13,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 711 transitions. [2022-01-11 00:19:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:13,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:13,943 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] [2022-01-11 00:19:13,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:19:13,946 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1602208598, now seen corresponding path program 1 times [2022-01-11 00:19:13,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:13,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640805084] [2022-01-11 00:19:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:13,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,036 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-11 00:19:14,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640805084] [2022-01-11 00:19:14,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640805084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:14,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521093756] [2022-01-11 00:19:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:14,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:14,039 INFO L87 Difference]: Start difference. First operand 488 states and 711 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,070 INFO L93 Difference]: Finished difference Result 964 states and 1405 transitions. [2022-01-11 00:19:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,072 INFO L225 Difference]: With dead ends: 964 [2022-01-11 00:19:14,072 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:14,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:14,079 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 404 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 410 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4435318275154003) internal successors, (703), 487 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 703 transitions. [2022-01-11 00:19:14,101 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 703 transitions. Word has length 66 [2022-01-11 00:19:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,102 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 703 transitions. [2022-01-11 00:19:14,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 703 transitions. [2022-01-11 00:19:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,105 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] [2022-01-11 00:19:14,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:19:14,105 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 335948588, now seen corresponding path program 1 times [2022-01-11 00:19:14,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377087369] [2022-01-11 00:19:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,184 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-11 00:19:14,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377087369] [2022-01-11 00:19:14,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377087369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:14,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877533371] [2022-01-11 00:19:14,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:14,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:14,187 INFO L87 Difference]: Start difference. First operand 488 states and 703 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,224 INFO L93 Difference]: Finished difference Result 963 states and 1388 transitions. [2022-01-11 00:19:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,227 INFO L225 Difference]: With dead ends: 963 [2022-01-11 00:19:14,227 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:14,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:14,233 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 398 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 405 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4271047227926077) internal successors, (695), 487 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 695 transitions. [2022-01-11 00:19:14,257 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 695 transitions. Word has length 66 [2022-01-11 00:19:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,259 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 695 transitions. [2022-01-11 00:19:14,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 695 transitions. [2022-01-11 00:19:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,260 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] [2022-01-11 00:19:14,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:19:14,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1264098198, now seen corresponding path program 1 times [2022-01-11 00:19:14,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504950611] [2022-01-11 00:19:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,322 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-11 00:19:14,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504950611] [2022-01-11 00:19:14,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504950611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:14,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115989292] [2022-01-11 00:19:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:14,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:14,325 INFO L87 Difference]: Start difference. First operand 488 states and 695 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,391 INFO L93 Difference]: Finished difference Result 962 states and 1371 transitions. [2022-01-11 00:19:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,393 INFO L225 Difference]: With dead ends: 962 [2022-01-11 00:19:14,393 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:14,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:14,395 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 345 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 428 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.3942505133470227) internal successors, (679), 487 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 679 transitions. [2022-01-11 00:19:14,419 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 679 transitions. Word has length 66 [2022-01-11 00:19:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,419 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 679 transitions. [2022-01-11 00:19:14,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 679 transitions. [2022-01-11 00:19:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,424 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] [2022-01-11 00:19:14,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:19:14,425 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1116136555, now seen corresponding path program 1 times [2022-01-11 00:19:14,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217043925] [2022-01-11 00:19:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,489 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-11 00:19:14,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217043925] [2022-01-11 00:19:14,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217043925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:14,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089170384] [2022-01-11 00:19:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:14,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:14,491 INFO L87 Difference]: Start difference. First operand 488 states and 679 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,543 INFO L93 Difference]: Finished difference Result 961 states and 1338 transitions. [2022-01-11 00:19:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,546 INFO L225 Difference]: With dead ends: 961 [2022-01-11 00:19:14,546 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:14,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:14,548 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 335 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 417 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.3613963039014374) internal successors, (663), 487 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 663 transitions. [2022-01-11 00:19:14,574 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 663 transitions. Word has length 66 [2022-01-11 00:19:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,574 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 663 transitions. [2022-01-11 00:19:14,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 663 transitions. [2022-01-11 00:19:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,575 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] [2022-01-11 00:19:14,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:19:14,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1411881320, now seen corresponding path program 1 times [2022-01-11 00:19:14,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762744274] [2022-01-11 00:19:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,624 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-11 00:19:14,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762744274] [2022-01-11 00:19:14,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762744274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:14,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031096663] [2022-01-11 00:19:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:14,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:14,626 INFO L87 Difference]: Start difference. First operand 488 states and 663 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,686 INFO L93 Difference]: Finished difference Result 960 states and 1305 transitions. [2022-01-11 00:19:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:14,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,689 INFO L225 Difference]: With dead ends: 960 [2022-01-11 00:19:14,689 INFO L226 Difference]: Without dead ends: 488 [2022-01-11 00:19:14,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:14,691 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 325 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 406 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-11 00:19:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-11 00:19:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.3285420944558521) internal successors, (647), 487 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 647 transitions. [2022-01-11 00:19:14,713 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 647 transitions. Word has length 66 [2022-01-11 00:19:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,713 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 647 transitions. [2022-01-11 00:19:14,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 647 transitions. [2022-01-11 00:19:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,718 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] [2022-01-11 00:19:14,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:19:14,718 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2074032233, now seen corresponding path program 1 times [2022-01-11 00:19:14,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740692328] [2022-01-11 00:19:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:14,798 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-11 00:19:14,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:14,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740692328] [2022-01-11 00:19:14,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740692328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:14,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:14,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:14,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236027902] [2022-01-11 00:19:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:14,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:14,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:14,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:14,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:14,801 INFO L87 Difference]: Start difference. First operand 488 states and 647 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:14,937 INFO L93 Difference]: Finished difference Result 1282 states and 1714 transitions. [2022-01-11 00:19:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:14,941 INFO L225 Difference]: With dead ends: 1282 [2022-01-11 00:19:14,941 INFO L226 Difference]: Without dead ends: 824 [2022-01-11 00:19:14,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 00:19:14,943 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 944 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:14,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [944 Valid, 1154 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-01-11 00:19:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 494. [2022-01-11 00:19:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.308316430020284) internal successors, (645), 493 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 645 transitions. [2022-01-11 00:19:14,981 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 645 transitions. Word has length 66 [2022-01-11 00:19:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:14,983 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 645 transitions. [2022-01-11 00:19:14,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 645 transitions. [2022-01-11 00:19:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:19:14,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:14,984 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] [2022-01-11 00:19:14,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:19:14,984 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1151348650, now seen corresponding path program 1 times [2022-01-11 00:19:14,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:14,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754540583] [2022-01-11 00:19:14,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:14,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:15,026 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-11 00:19:15,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:15,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754540583] [2022-01-11 00:19:15,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754540583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:15,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:15,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:15,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924361262] [2022-01-11 00:19:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:15,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:15,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:15,029 INFO L87 Difference]: Start difference. First operand 494 states and 645 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:15,143 INFO L93 Difference]: Finished difference Result 1382 states and 1794 transitions. [2022-01-11 00:19:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 00:19:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:15,147 INFO L225 Difference]: With dead ends: 1382 [2022-01-11 00:19:15,147 INFO L226 Difference]: Without dead ends: 941 [2022-01-11 00:19:15,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:15,149 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 292 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:15,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 725 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-01-11 00:19:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 882. [2022-01-11 00:19:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.2860385925085132) internal successors, (1133), 881 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1133 transitions. [2022-01-11 00:19:15,206 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1133 transitions. Word has length 66 [2022-01-11 00:19:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:15,206 INFO L470 AbstractCegarLoop]: Abstraction has 882 states and 1133 transitions. [2022-01-11 00:19:15,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1133 transitions. [2022-01-11 00:19:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 00:19:15,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:15,208 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-11 00:19:15,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:19:15,209 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1581131927, now seen corresponding path program 1 times [2022-01-11 00:19:15,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658027634] [2022-01-11 00:19:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:15,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:15,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:15,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658027634] [2022-01-11 00:19:15,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658027634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:15,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:15,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:15,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693695969] [2022-01-11 00:19:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:15,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:15,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:15,259 INFO L87 Difference]: Start difference. First operand 882 states and 1133 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:15,378 INFO L93 Difference]: Finished difference Result 2382 states and 3053 transitions. [2022-01-11 00:19:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:15,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-11 00:19:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:15,385 INFO L225 Difference]: With dead ends: 2382 [2022-01-11 00:19:15,385 INFO L226 Difference]: Without dead ends: 1601 [2022-01-11 00:19:15,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:15,389 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 255 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:15,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 789 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-01-11 00:19:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1598. [2022-01-11 00:19:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.2711333750782718) internal successors, (2030), 1597 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2030 transitions. [2022-01-11 00:19:15,496 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2030 transitions. Word has length 67 [2022-01-11 00:19:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:15,496 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 2030 transitions. [2022-01-11 00:19:15,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2030 transitions. [2022-01-11 00:19:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 00:19:15,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:15,498 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-11 00:19:15,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:19:15,498 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -226715594, now seen corresponding path program 1 times [2022-01-11 00:19:15,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:15,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365247101] [2022-01-11 00:19:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:15,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:15,536 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-11 00:19:15,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365247101] [2022-01-11 00:19:15,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365247101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:15,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:15,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:15,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737657673] [2022-01-11 00:19:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:15,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:15,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:15,539 INFO L87 Difference]: Start difference. First operand 1598 states and 2030 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:15,661 INFO L93 Difference]: Finished difference Result 3001 states and 3826 transitions. [2022-01-11 00:19:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-11 00:19:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:15,667 INFO L225 Difference]: With dead ends: 3001 [2022-01-11 00:19:15,667 INFO L226 Difference]: Without dead ends: 1504 [2022-01-11 00:19:15,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:15,671 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 369 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 373 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-11 00:19:15,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 373 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-01-11 00:19:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2022-01-11 00:19:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 1.2747837658017298) internal successors, (1916), 1503 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1916 transitions. [2022-01-11 00:19:15,766 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1916 transitions. Word has length 67 [2022-01-11 00:19:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:15,766 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 1916 transitions. [2022-01-11 00:19:15,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1916 transitions. [2022-01-11 00:19:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 00:19:15,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:15,767 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-11 00:19:15,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:19:15,768 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1882471076, now seen corresponding path program 1 times [2022-01-11 00:19:15,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106748535] [2022-01-11 00:19:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:15,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:15,799 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-11 00:19:15,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:15,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106748535] [2022-01-11 00:19:15,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106748535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:15,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:15,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:15,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250281725] [2022-01-11 00:19:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:15,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:15,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:15,802 INFO L87 Difference]: Start difference. First operand 1504 states and 1916 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:16,033 INFO L93 Difference]: Finished difference Result 4196 states and 5336 transitions. [2022-01-11 00:19:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 00:19:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:16,043 INFO L225 Difference]: With dead ends: 4196 [2022-01-11 00:19:16,043 INFO L226 Difference]: Without dead ends: 2793 [2022-01-11 00:19:16,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:16,046 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 294 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:16,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 748 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2022-01-11 00:19:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2702. [2022-01-11 00:19:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.2632358385783042) internal successors, (3412), 2701 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3412 transitions. [2022-01-11 00:19:16,223 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3412 transitions. Word has length 68 [2022-01-11 00:19:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:16,223 INFO L470 AbstractCegarLoop]: Abstraction has 2702 states and 3412 transitions. [2022-01-11 00:19:16,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3412 transitions. [2022-01-11 00:19:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 00:19:16,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:16,224 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-11 00:19:16,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:19:16,225 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1800104452, now seen corresponding path program 1 times [2022-01-11 00:19:16,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:16,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853015726] [2022-01-11 00:19:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:16,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:16,245 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-11 00:19:16,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:16,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853015726] [2022-01-11 00:19:16,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853015726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:16,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:16,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:16,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688291683] [2022-01-11 00:19:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:16,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:16,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:16,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:16,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:16,248 INFO L87 Difference]: Start difference. First operand 2702 states and 3412 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:16,416 INFO L93 Difference]: Finished difference Result 5243 states and 6632 transitions. [2022-01-11 00:19:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 00:19:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:16,425 INFO L225 Difference]: With dead ends: 5243 [2022-01-11 00:19:16,425 INFO L226 Difference]: Without dead ends: 2610 [2022-01-11 00:19:16,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:16,429 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 367 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 372 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-11 00:19:16,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 372 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-01-11 00:19:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2022-01-11 00:19:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 1.2656190111153698) internal successors, (3302), 2609 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3302 transitions. [2022-01-11 00:19:16,624 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3302 transitions. Word has length 68 [2022-01-11 00:19:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:16,624 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 3302 transitions. [2022-01-11 00:19:16,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3302 transitions. [2022-01-11 00:19:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 00:19:16,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:16,625 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-11 00:19:16,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:19:16,626 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -552955422, now seen corresponding path program 1 times [2022-01-11 00:19:16,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:16,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122234520] [2022-01-11 00:19:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:16,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:16,677 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-11 00:19:16,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122234520] [2022-01-11 00:19:16,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122234520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:16,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:16,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:16,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910224548] [2022-01-11 00:19:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:16,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:16,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:16,679 INFO L87 Difference]: Start difference. First operand 2610 states and 3302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:16,990 INFO L93 Difference]: Finished difference Result 7571 states and 9592 transitions. [2022-01-11 00:19:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 00:19:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:17,007 INFO L225 Difference]: With dead ends: 7571 [2022-01-11 00:19:17,007 INFO L226 Difference]: Without dead ends: 5034 [2022-01-11 00:19:17,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:17,012 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 288 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:17,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 660 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2022-01-11 00:19:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 5002. [2022-01-11 00:19:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5002 states, 5001 states have (on average 1.255748850229954) internal successors, (6280), 5001 states have internal predecessors, (6280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 6280 transitions. [2022-01-11 00:19:17,336 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 6280 transitions. Word has length 69 [2022-01-11 00:19:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:17,336 INFO L470 AbstractCegarLoop]: Abstraction has 5002 states and 6280 transitions. [2022-01-11 00:19:17,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 6280 transitions. [2022-01-11 00:19:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 00:19:17,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:17,340 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:17,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:19:17,340 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -186417373, now seen corresponding path program 1 times [2022-01-11 00:19:17,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:17,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393085294] [2022-01-11 00:19:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:17,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:17,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:17,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393085294] [2022-01-11 00:19:17,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393085294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:17,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:17,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:17,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961765510] [2022-01-11 00:19:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:17,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:17,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:17,387 INFO L87 Difference]: Start difference. First operand 5002 states and 6280 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:18,006 INFO L93 Difference]: Finished difference Result 14765 states and 18518 transitions. [2022-01-11 00:19:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:18,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-11 00:19:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:18,043 INFO L225 Difference]: With dead ends: 14765 [2022-01-11 00:19:18,043 INFO L226 Difference]: Without dead ends: 9862 [2022-01-11 00:19:18,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:18,054 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 328 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:18,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 1055 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9862 states. [2022-01-11 00:19:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9862 to 9862. [2022-01-11 00:19:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9862 states, 9861 states have (on average 1.2481492749214076) internal successors, (12308), 9861 states have internal predecessors, (12308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 12308 transitions. [2022-01-11 00:19:18,627 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 12308 transitions. Word has length 87 [2022-01-11 00:19:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:18,628 INFO L470 AbstractCegarLoop]: Abstraction has 9862 states and 12308 transitions. [2022-01-11 00:19:18,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 12308 transitions. [2022-01-11 00:19:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:19:18,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:18,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:18,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:19:18,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash -111346000, now seen corresponding path program 1 times [2022-01-11 00:19:18,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:18,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948266649] [2022-01-11 00:19:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:18,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 00:19:18,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:18,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948266649] [2022-01-11 00:19:18,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948266649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:18,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:18,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:18,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658834370] [2022-01-11 00:19:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:18,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:18,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:18,704 INFO L87 Difference]: Start difference. First operand 9862 states and 12308 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:19,582 INFO L93 Difference]: Finished difference Result 28708 states and 35828 transitions. [2022-01-11 00:19:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:19,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-11 00:19:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:19,626 INFO L225 Difference]: With dead ends: 28708 [2022-01-11 00:19:19,627 INFO L226 Difference]: Without dead ends: 18925 [2022-01-11 00:19:19,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:19,646 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 285 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:19,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 663 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18925 states. [2022-01-11 00:19:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18925 to 18234. [2022-01-11 00:19:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18234 states, 18233 states have (on average 1.2386332474085449) internal successors, (22584), 18233 states have internal predecessors, (22584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18234 states to 18234 states and 22584 transitions. [2022-01-11 00:19:20,781 INFO L78 Accepts]: Start accepts. Automaton has 18234 states and 22584 transitions. Word has length 118 [2022-01-11 00:19:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:20,782 INFO L470 AbstractCegarLoop]: Abstraction has 18234 states and 22584 transitions. [2022-01-11 00:19:20,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18234 states and 22584 transitions. [2022-01-11 00:19:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:19:20,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:20,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:20,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:19:20,794 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1674586512, now seen corresponding path program 1 times [2022-01-11 00:19:20,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:20,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950467184] [2022-01-11 00:19:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:20,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:20,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950467184] [2022-01-11 00:19:20,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950467184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:20,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:20,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:20,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232664455] [2022-01-11 00:19:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:20,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:20,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:20,836 INFO L87 Difference]: Start difference. First operand 18234 states and 22584 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:21,679 INFO L93 Difference]: Finished difference Result 27413 states and 34062 transitions. [2022-01-11 00:19:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:21,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-11 00:19:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:21,727 INFO L225 Difference]: With dead ends: 27413 [2022-01-11 00:19:21,727 INFO L226 Difference]: Without dead ends: 18234 [2022-01-11 00:19:21,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:21,747 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 272 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:21,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 990 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18234 states. [2022-01-11 00:19:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18234 to 18172. [2022-01-11 00:19:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18172 states, 18171 states have (on average 1.2262396125694788) internal successors, (22282), 18171 states have internal predecessors, (22282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18172 states to 18172 states and 22282 transitions. [2022-01-11 00:19:22,588 INFO L78 Accepts]: Start accepts. Automaton has 18172 states and 22282 transitions. Word has length 118 [2022-01-11 00:19:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:22,589 INFO L470 AbstractCegarLoop]: Abstraction has 18172 states and 22282 transitions. [2022-01-11 00:19:22,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18172 states and 22282 transitions. [2022-01-11 00:19:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:19:22,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:22,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:22,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:19:22,601 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2102600023, now seen corresponding path program 1 times [2022-01-11 00:19:22,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:22,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10941880] [2022-01-11 00:19:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:22,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-11 00:19:22,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:22,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10941880] [2022-01-11 00:19:22,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10941880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:22,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:22,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:22,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287900860] [2022-01-11 00:19:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:22,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:22,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:22,660 INFO L87 Difference]: Start difference. First operand 18172 states and 22282 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:23,874 INFO L93 Difference]: Finished difference Result 44202 states and 54190 transitions. [2022-01-11 00:19:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-01-11 00:19:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:23,930 INFO L225 Difference]: With dead ends: 44202 [2022-01-11 00:19:23,930 INFO L226 Difference]: Without dead ends: 26133 [2022-01-11 00:19:23,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:23,955 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 233 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:23,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 655 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26133 states. [2022-01-11 00:19:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26133 to 26000. [2022-01-11 00:19:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26000 states, 25999 states have (on average 1.2185853302050078) internal successors, (31682), 25999 states have internal predecessors, (31682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26000 states to 26000 states and 31682 transitions. [2022-01-11 00:19:25,129 INFO L78 Accepts]: Start accepts. Automaton has 26000 states and 31682 transitions. Word has length 118 [2022-01-11 00:19:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:25,129 INFO L470 AbstractCegarLoop]: Abstraction has 26000 states and 31682 transitions. [2022-01-11 00:19:25,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26000 states and 31682 transitions. [2022-01-11 00:19:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-11 00:19:25,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:25,146 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:25,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:19:25,147 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 643382104, now seen corresponding path program 1 times [2022-01-11 00:19:25,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:25,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378674108] [2022-01-11 00:19:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:25,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 00:19:25,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378674108] [2022-01-11 00:19:25,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378674108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:25,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:25,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:25,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061620003] [2022-01-11 00:19:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:25,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:25,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:25,203 INFO L87 Difference]: Start difference. First operand 26000 states and 31682 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:27,987 INFO L93 Difference]: Finished difference Result 83843 states and 101722 transitions. [2022-01-11 00:19:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-11 00:19:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:28,115 INFO L225 Difference]: With dead ends: 83843 [2022-01-11 00:19:28,116 INFO L226 Difference]: Without dead ends: 57968 [2022-01-11 00:19:28,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 00:19:28,162 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 1124 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:28,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1766 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57968 states. [2022-01-11 00:19:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57968 to 26888. [2022-01-11 00:19:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26888 states, 26887 states have (on average 1.2037787778480307) internal successors, (32366), 26887 states have internal predecessors, (32366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26888 states to 26888 states and 32366 transitions. [2022-01-11 00:19:30,065 INFO L78 Accepts]: Start accepts. Automaton has 26888 states and 32366 transitions. Word has length 119 [2022-01-11 00:19:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:30,066 INFO L470 AbstractCegarLoop]: Abstraction has 26888 states and 32366 transitions. [2022-01-11 00:19:30,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26888 states and 32366 transitions. [2022-01-11 00:19:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-11 00:19:30,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:30,081 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:30,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:19:30,081 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1415661368, now seen corresponding path program 1 times [2022-01-11 00:19:30,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978596193] [2022-01-11 00:19:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:30,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 00:19:30,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978596193] [2022-01-11 00:19:30,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978596193] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:30,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:30,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:30,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832461949] [2022-01-11 00:19:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:30,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:30,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:30,132 INFO L87 Difference]: Start difference. First operand 26888 states and 32366 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:32,079 INFO L93 Difference]: Finished difference Result 61659 states and 74434 transitions. [2022-01-11 00:19:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-11 00:19:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:32,132 INFO L225 Difference]: With dead ends: 61659 [2022-01-11 00:19:32,132 INFO L226 Difference]: Without dead ends: 34890 [2022-01-11 00:19:32,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 00:19:32,165 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 865 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:32,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1038 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34890 states. [2022-01-11 00:19:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34890 to 26984. [2022-01-11 00:19:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26984 states, 26983 states have (on average 1.1857095208093986) internal successors, (31994), 26983 states have internal predecessors, (31994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26984 states to 26984 states and 31994 transitions. [2022-01-11 00:19:34,039 INFO L78 Accepts]: Start accepts. Automaton has 26984 states and 31994 transitions. Word has length 119 [2022-01-11 00:19:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:34,039 INFO L470 AbstractCegarLoop]: Abstraction has 26984 states and 31994 transitions. [2022-01-11 00:19:34,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26984 states and 31994 transitions. [2022-01-11 00:19:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-11 00:19:34,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:34,052 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:34,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:19:34,052 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash -466345192, now seen corresponding path program 1 times [2022-01-11 00:19:34,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:34,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814572839] [2022-01-11 00:19:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:34,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 00:19:34,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:34,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814572839] [2022-01-11 00:19:34,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814572839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:34,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:34,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:34,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027219364] [2022-01-11 00:19:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:34,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:34,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:34,100 INFO L87 Difference]: Start difference. First operand 26984 states and 31994 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:36,267 INFO L93 Difference]: Finished difference Result 51709 states and 61692 transitions. [2022-01-11 00:19:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-11 00:19:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:36,309 INFO L225 Difference]: With dead ends: 51709 [2022-01-11 00:19:36,310 INFO L226 Difference]: Without dead ends: 24802 [2022-01-11 00:19:36,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 00:19:36,337 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 777 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:36,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [777 Valid, 1220 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2022-01-11 00:19:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 18396. [2022-01-11 00:19:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18396 states, 18395 states have (on average 1.1712965479749933) internal successors, (21546), 18395 states have internal predecessors, (21546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18396 states to 18396 states and 21546 transitions. [2022-01-11 00:19:37,536 INFO L78 Accepts]: Start accepts. Automaton has 18396 states and 21546 transitions. Word has length 119 [2022-01-11 00:19:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:37,536 INFO L470 AbstractCegarLoop]: Abstraction has 18396 states and 21546 transitions. [2022-01-11 00:19:37,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18396 states and 21546 transitions. [2022-01-11 00:19:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 00:19:37,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:37,545 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:37,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:19:37,545 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1435930162, now seen corresponding path program 1 times [2022-01-11 00:19:37,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024929314] [2022-01-11 00:19:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:37,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:37,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:37,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024929314] [2022-01-11 00:19:37,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024929314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:37,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:37,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:37,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497939193] [2022-01-11 00:19:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:37,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:37,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:37,580 INFO L87 Difference]: Start difference. First operand 18396 states and 21546 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:38,969 INFO L93 Difference]: Finished difference Result 32622 states and 38302 transitions. [2022-01-11 00:19:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-11 00:19:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:38,992 INFO L225 Difference]: With dead ends: 32622 [2022-01-11 00:19:38,992 INFO L226 Difference]: Without dead ends: 18401 [2022-01-11 00:19:39,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:39,008 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 234 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:39,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 911 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18401 states. [2022-01-11 00:19:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18401 to 18396. [2022-01-11 00:19:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18396 states, 18395 states have (on average 1.1667300896982875) internal successors, (21462), 18395 states have internal predecessors, (21462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18396 states to 18396 states and 21462 transitions. [2022-01-11 00:19:40,339 INFO L78 Accepts]: Start accepts. Automaton has 18396 states and 21462 transitions. Word has length 122 [2022-01-11 00:19:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:40,339 INFO L470 AbstractCegarLoop]: Abstraction has 18396 states and 21462 transitions. [2022-01-11 00:19:40,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18396 states and 21462 transitions. [2022-01-11 00:19:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 00:19:40,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:40,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:40,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:19:40,350 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2035709502, now seen corresponding path program 1 times [2022-01-11 00:19:40,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771824777] [2022-01-11 00:19:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:40,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:40,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771824777] [2022-01-11 00:19:40,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771824777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:40,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:40,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:40,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284371684] [2022-01-11 00:19:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:40,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:40,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:40,394 INFO L87 Difference]: Start difference. First operand 18396 states and 21462 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:41,604 INFO L93 Difference]: Finished difference Result 36702 states and 42830 transitions. [2022-01-11 00:19:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-11 00:19:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:41,621 INFO L225 Difference]: With dead ends: 36702 [2022-01-11 00:19:41,621 INFO L226 Difference]: Without dead ends: 16347 [2022-01-11 00:19:41,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:41,633 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 230 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:41,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 860 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16347 states. [2022-01-11 00:19:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16347 to 16342. [2022-01-11 00:19:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16342 states, 16341 states have (on average 1.15819105317912) internal successors, (18926), 16341 states have internal predecessors, (18926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 18926 transitions. [2022-01-11 00:19:42,587 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 18926 transitions. Word has length 158 [2022-01-11 00:19:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:42,587 INFO L470 AbstractCegarLoop]: Abstraction has 16342 states and 18926 transitions. [2022-01-11 00:19:42,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 18926 transitions. [2022-01-11 00:19:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-11 00:19:42,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:42,595 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:42,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:19:42,595 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash -796478296, now seen corresponding path program 1 times [2022-01-11 00:19:42,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:42,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516130196] [2022-01-11 00:19:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:42,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:42,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516130196] [2022-01-11 00:19:42,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516130196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:42,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059944628] [2022-01-11 00:19:42,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,638 INFO L87 Difference]: Start difference. First operand 16342 states and 18926 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:43,639 INFO L93 Difference]: Finished difference Result 29491 states and 34212 transitions. [2022-01-11 00:19:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:43,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-01-11 00:19:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:43,662 INFO L225 Difference]: With dead ends: 29491 [2022-01-11 00:19:43,662 INFO L226 Difference]: Without dead ends: 16390 [2022-01-11 00:19:43,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:43,677 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 264 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:43,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 856 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16390 states. [2022-01-11 00:19:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16390 to 16342. [2022-01-11 00:19:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16342 states, 16341 states have (on average 1.1383636252371336) internal successors, (18602), 16341 states have internal predecessors, (18602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 18602 transitions. [2022-01-11 00:19:44,778 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 18602 transitions. Word has length 190 [2022-01-11 00:19:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:44,778 INFO L470 AbstractCegarLoop]: Abstraction has 16342 states and 18602 transitions. [2022-01-11 00:19:44,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 18602 transitions. [2022-01-11 00:19:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-01-11 00:19:44,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,785 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:44,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:19:44,785 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1881684828, now seen corresponding path program 1 times [2022-01-11 00:19:44,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224462661] [2022-01-11 00:19:44,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 00:19:44,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224462661] [2022-01-11 00:19:44,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224462661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:44,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433732310] [2022-01-11 00:19:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,834 INFO L87 Difference]: Start difference. First operand 16342 states and 18602 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,719 INFO L93 Difference]: Finished difference Result 29469 states and 33366 transitions. [2022-01-11 00:19:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2022-01-11 00:19:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,729 INFO L225 Difference]: With dead ends: 29469 [2022-01-11 00:19:45,729 INFO L226 Difference]: Without dead ends: 8448 [2022-01-11 00:19:45,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:45,743 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 312 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 779 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8448 states. [2022-01-11 00:19:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8448 to 8232. [2022-01-11 00:19:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8232 states, 8231 states have (on average 1.0992588992831978) internal successors, (9048), 8231 states have internal predecessors, (9048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8232 states to 8232 states and 9048 transitions. [2022-01-11 00:19:46,234 INFO L78 Accepts]: Start accepts. Automaton has 8232 states and 9048 transitions. Word has length 192 [2022-01-11 00:19:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,235 INFO L470 AbstractCegarLoop]: Abstraction has 8232 states and 9048 transitions. [2022-01-11 00:19:46,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8232 states and 9048 transitions. [2022-01-11 00:19:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-11 00:19:46,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:46,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:19:46,243 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1967386507, now seen corresponding path program 1 times [2022-01-11 00:19:46,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826592070] [2022-01-11 00:19:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:46,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826592070] [2022-01-11 00:19:46,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826592070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:46,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377275286] [2022-01-11 00:19:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,290 INFO L87 Difference]: Start difference. First operand 8232 states and 9048 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,704 INFO L93 Difference]: Finished difference Result 9795 states and 10770 transitions. [2022-01-11 00:19:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-01-11 00:19:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,712 INFO L225 Difference]: With dead ends: 9795 [2022-01-11 00:19:46,712 INFO L226 Difference]: Without dead ends: 6868 [2022-01-11 00:19:46,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 00:19:46,716 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 213 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 649 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-01-11 00:19:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2022-01-11 00:19:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6868 states, 6867 states have (on average 1.0945099752439202) internal successors, (7516), 6867 states have internal predecessors, (7516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 7516 transitions. [2022-01-11 00:19:47,122 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 7516 transitions. Word has length 194 [2022-01-11 00:19:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,123 INFO L470 AbstractCegarLoop]: Abstraction has 6868 states and 7516 transitions. [2022-01-11 00:19:47,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 7516 transitions. [2022-01-11 00:19:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 00:19:47,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,129 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:19:47,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:19:47,129 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1031822847, now seen corresponding path program 1 times [2022-01-11 00:19:47,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393043668] [2022-01-11 00:19:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:19:47,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 00:19:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:19:47,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 00:19:47,233 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 00:19:47,234 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 00:19:47,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 00:19:47,238 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:47,241 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:19:47,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:19:47 BasicIcfg [2022-01-11 00:19:47,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:19:47,609 INFO L158 Benchmark]: Toolchain (without parser) took 35899.20ms. Allocated memory was 201.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 145.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-01-11 00:19:47,609 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:19:47,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.45ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 145.0MB in the beginning and 278.3MB in the end (delta: -133.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-01-11 00:19:47,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.64ms. Allocated memory is still 310.4MB. Free memory was 278.3MB in the beginning and 274.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 00:19:47,610 INFO L158 Benchmark]: Boogie Preprocessor took 48.64ms. Allocated memory is still 310.4MB. Free memory was 274.6MB in the beginning and 272.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:19:47,611 INFO L158 Benchmark]: RCFGBuilder took 745.72ms. Allocated memory is still 310.4MB. Free memory was 272.0MB in the beginning and 240.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-11 00:19:47,612 INFO L158 Benchmark]: IcfgTransformer took 213.71ms. Allocated memory is still 310.4MB. Free memory was 240.5MB in the beginning and 225.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 00:19:47,613 INFO L158 Benchmark]: TraceAbstraction took 34547.40ms. Allocated memory was 310.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 225.3MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-01-11 00:19:47,617 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 201.3MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.45ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 145.0MB in the beginning and 278.3MB in the end (delta: -133.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.64ms. Allocated memory is still 310.4MB. Free memory was 278.3MB in the beginning and 274.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.64ms. Allocated memory is still 310.4MB. Free memory was 274.6MB in the beginning and 272.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 745.72ms. Allocated memory is still 310.4MB. Free memory was 272.0MB in the beginning and 240.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * IcfgTransformer took 213.71ms. Allocated memory is still 310.4MB. Free memory was 240.5MB in the beginning and 225.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 34547.40ms. Allocated memory was 310.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 225.3MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 2.7GB. 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 t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_st=0] [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 [L645] FCALL update_channels() [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] RET init_threads() [L647] CALL fire_delta_events() [L418] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L423] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L428] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L433] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L438] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L443] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L448] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L647] RET fire_delta_events() [L648] CALL activate_threads() [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0] [L648] RET activate_threads() [L649] CALL reset_delta_events() [L461] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L466] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L471] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L476] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L481] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L486] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L491] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] RET reset_delta_events() [L652] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L332] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] RET, EXPR exists_runnable_thread() [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L177] t3_pc = 1 [L178] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, tmp_ndt_3=1, tmp_ndt_4=5] [L344] CALL, EXPR exists_runnable_thread() [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L332] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L344] RET, EXPR exists_runnable_thread() [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, tmp_ndt_3=1, tmp_ndt_4=5] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L67] E_1 = 1 [L68] CALL immediate_notify() [L548] CALL activate_threads() [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [__retres1=1, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\result=-1, __retres1=1, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0] [L548] RET activate_threads() [L68] RET immediate_notify() [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L113] E_2 = 1 [L114] CALL immediate_notify() [L548] CALL activate_threads() [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0] [L548] RET activate_threads() [L114] RET immediate_notify() [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L148] E_3 = 1 [L149] CALL immediate_notify() [L548] CALL activate_threads() [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1] [L548] RET activate_threads() [L149] RET immediate_notify() [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 292 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10533 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10533 mSDsluCounter, 19496 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8119 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 498 IncrementalHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 11377 mSDtfsCounter, 498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26984occurred in iteration=20, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 47070 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2783 NumberOfCodeBlocks, 2783 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2561 ConstructedInterpolants, 0 QuantifiedInterpolants, 4122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 216/216 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-11 00:19:47,659 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...