/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/bitvector/soft_float_1-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:49,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:49,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:49,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:49,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:49,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:49,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:49,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:49,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:49,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:49,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:49,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:49,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:49,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:49,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:49,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:49,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:49,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:49,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:49,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:49,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:49,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:49,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:49,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:49,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:49,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:49,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:49,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:49,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:49,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:49,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:49,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:49,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:49,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:49,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:49,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:49,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:49,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:49,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:49,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:49,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:49,857 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-10 20:08:49,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:49,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:49,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:49,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:49,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:49,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:49,872 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:49,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:49,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:49,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:49,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:49,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:49,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:49,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:49,876 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:49,876 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-10 20:08:50,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:50,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:50,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:50,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:50,033 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:50,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c [2022-01-10 20:08:50,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6328e124f/2569c33f963f4dfe877286be7d4fc73f/FLAG84d9f9ed3 [2022-01-10 20:08:50,457 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:50,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c [2022-01-10 20:08:50,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6328e124f/2569c33f963f4dfe877286be7d4fc73f/FLAG84d9f9ed3 [2022-01-10 20:08:50,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6328e124f/2569c33f963f4dfe877286be7d4fc73f [2022-01-10 20:08:50,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:50,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:50,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:50,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:50,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:50,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:50" (1/1) ... [2022-01-10 20:08:50,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374bf7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:50, skipping insertion in model container [2022-01-10 20:08:50,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:50" (1/1) ... [2022-01-10 20:08:50,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:50,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:51,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-01-10 20:08:51,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:51,080 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:51,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-01-10 20:08:51,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:51,137 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:51,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51 WrapperNode [2022-01-10 20:08:51,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:51,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:51,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:51,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:51,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,185 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 14, calls inlined = 12, statements flattened = 301 [2022-01-10 20:08:51,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:51,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:51,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:51,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:51,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:51,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:51,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:51,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:51,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:51,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:08:51,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:08:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:51,315 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:51,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:51,555 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:51,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:51,562 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 20:08:51,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:51 BoogieIcfgContainer [2022-01-10 20:08:51,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:51,564 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:51,564 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:51,565 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:51,567 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:51" (1/1) ... [2022-01-10 20:08:51,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:51 BasicIcfg [2022-01-10 20:08:51,683 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:51,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:51,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:51,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:51,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:50" (1/4) ... [2022-01-10 20:08:51,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:51, skipping insertion in model container [2022-01-10 20:08:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:51" (2/4) ... [2022-01-10 20:08:51,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:51, skipping insertion in model container [2022-01-10 20:08:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:51" (3/4) ... [2022-01-10 20:08:51,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:51, skipping insertion in model container [2022-01-10 20:08:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:51" (4/4) ... [2022-01-10 20:08:51,689 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.cTransformedIcfg [2022-01-10 20:08:51,692 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:51,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-01-10 20:08:51,728 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:51,733 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:08:51,733 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-10 20:08:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 92 states have (on average 1.7065217391304348) internal successors, (157), 98 states have internal predecessors, (157), 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-10 20:08:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 20:08:51,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1037068271, now seen corresponding path program 1 times [2022-01-10 20:08:51,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56214817] [2022-01-10 20:08:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:51,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56214817] [2022-01-10 20:08:51,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56214817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:51,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:51,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:51,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755837501] [2022-01-10 20:08:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:51,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:51,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:51,992 INFO L87 Difference]: Start difference. First operand has 99 states, 92 states have (on average 1.7065217391304348) internal successors, (157), 98 states have internal predecessors, (157), 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 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-10 20:08:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,206 INFO L93 Difference]: Finished difference Result 534 states and 796 transitions. [2022-01-10 20:08:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:08:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-01-10 20:08:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,216 INFO L225 Difference]: With dead ends: 534 [2022-01-10 20:08:52,217 INFO L226 Difference]: Without dead ends: 415 [2022-01-10 20:08:52,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 20:08:52,221 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 901 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 647 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-01-10 20:08:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 122. [2022-01-10 20:08:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 116 states have (on average 1.5) internal successors, (174), 121 states have internal predecessors, (174), 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-10 20:08:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2022-01-10 20:08:52,252 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 18 [2022-01-10 20:08:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,252 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2022-01-10 20:08:52,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-10 20:08:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-01-10 20:08:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:08:52,253 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,253 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] [2022-01-10 20:08:52,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:52,254 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,254 INFO L85 PathProgramCache]: Analyzing trace with hash -653069485, now seen corresponding path program 1 times [2022-01-10 20:08:52,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472329782] [2022-01-10 20:08:52,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:52,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472329782] [2022-01-10 20:08:52,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472329782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:52,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125422469] [2022-01-10 20:08:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:52,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:52,322 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,429 INFO L93 Difference]: Finished difference Result 404 states and 553 transitions. [2022-01-10 20:08:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:08:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 20:08:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,431 INFO L225 Difference]: With dead ends: 404 [2022-01-10 20:08:52,432 INFO L226 Difference]: Without dead ends: 345 [2022-01-10 20:08:52,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:08:52,433 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 700 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 446 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-01-10 20:08:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 152. [2022-01-10 20:08:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 151 states have internal predecessors, (217), 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-10 20:08:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 217 transitions. [2022-01-10 20:08:52,455 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 217 transitions. Word has length 22 [2022-01-10 20:08:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,455 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 217 transitions. [2022-01-10 20:08:52,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 217 transitions. [2022-01-10 20:08:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:08:52,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,456 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] [2022-01-10 20:08:52,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:52,456 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash -849582990, now seen corresponding path program 1 times [2022-01-10 20:08:52,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561538110] [2022-01-10 20:08:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:52,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561538110] [2022-01-10 20:08:52,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561538110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:52,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179879634] [2022-01-10 20:08:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:52,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:52,509 INFO L87 Difference]: Start difference. First operand 152 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,625 INFO L93 Difference]: Finished difference Result 335 states and 457 transitions. [2022-01-10 20:08:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 20:08:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,628 INFO L225 Difference]: With dead ends: 335 [2022-01-10 20:08:52,628 INFO L226 Difference]: Without dead ends: 281 [2022-01-10 20:08:52,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:08:52,634 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 500 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 588 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-01-10 20:08:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 173. [2022-01-10 20:08:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 167 states have (on average 1.4550898203592815) internal successors, (243), 172 states have internal predecessors, (243), 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-10 20:08:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 243 transitions. [2022-01-10 20:08:52,664 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 243 transitions. Word has length 22 [2022-01-10 20:08:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,665 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 243 transitions. [2022-01-10 20:08:52,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 243 transitions. [2022-01-10 20:08:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:08:52,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,666 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] [2022-01-10 20:08:52,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:08:52,666 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 37920691, now seen corresponding path program 1 times [2022-01-10 20:08:52,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227568530] [2022-01-10 20:08:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:52,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227568530] [2022-01-10 20:08:52,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227568530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:52,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380767215] [2022-01-10 20:08:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:52,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:52,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:52,763 INFO L87 Difference]: Start difference. First operand 173 states and 243 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:52,856 INFO L93 Difference]: Finished difference Result 278 states and 381 transitions. [2022-01-10 20:08:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 20:08:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:52,857 INFO L225 Difference]: With dead ends: 278 [2022-01-10 20:08:52,858 INFO L226 Difference]: Without dead ends: 227 [2022-01-10 20:08:52,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:08:52,868 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 360 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:52,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 512 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-10 20:08:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 210. [2022-01-10 20:08:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 204 states have (on average 1.4607843137254901) internal successors, (298), 209 states have internal predecessors, (298), 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-10 20:08:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2022-01-10 20:08:52,885 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 22 [2022-01-10 20:08:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:52,886 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2022-01-10 20:08:52,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2022-01-10 20:08:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 20:08:52,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:52,887 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] [2022-01-10 20:08:52,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:08:52,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 37950482, now seen corresponding path program 1 times [2022-01-10 20:08:52,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249297351] [2022-01-10 20:08:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:52,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:52,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249297351] [2022-01-10 20:08:52,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249297351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:52,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985183529] [2022-01-10 20:08:52,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:52,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:52,968 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:53,057 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2022-01-10 20:08:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 20:08:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:53,058 INFO L225 Difference]: With dead ends: 295 [2022-01-10 20:08:53,058 INFO L226 Difference]: Without dead ends: 245 [2022-01-10 20:08:53,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:08:53,059 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 258 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:53,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 588 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-10 20:08:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 200. [2022-01-10 20:08:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.4484536082474226) internal successors, (281), 199 states have internal predecessors, (281), 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-10 20:08:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2022-01-10 20:08:53,068 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 22 [2022-01-10 20:08:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:53,069 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2022-01-10 20:08:53,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10 20:08:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2022-01-10 20:08:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 20:08:53,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,079 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] [2022-01-10 20:08:53,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:08:53,079 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1409245758, now seen corresponding path program 1 times [2022-01-10 20:08:53,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235294537] [2022-01-10 20:08:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:53,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:53,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235294537] [2022-01-10 20:08:53,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235294537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:53,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:53,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:08:53,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502147724] [2022-01-10 20:08:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:53,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:08:53,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:53,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:08:53,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:08:53,151 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-10 20:08:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:53,318 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2022-01-10 20:08:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:08:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2022-01-10 20:08:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:53,320 INFO L225 Difference]: With dead ends: 432 [2022-01-10 20:08:53,320 INFO L226 Difference]: Without dead ends: 366 [2022-01-10 20:08:53,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:08:53,322 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 602 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:53,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 794 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-01-10 20:08:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 256. [2022-01-10 20:08:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 250 states have (on average 1.424) internal successors, (356), 255 states have internal predecessors, (356), 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-10 20:08:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 356 transitions. [2022-01-10 20:08:53,333 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 356 transitions. Word has length 26 [2022-01-10 20:08:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:53,333 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 356 transitions. [2022-01-10 20:08:53,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-10 20:08:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2022-01-10 20:08:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:08:53,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,334 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] [2022-01-10 20:08:53,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:08:53,334 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 177288508, now seen corresponding path program 1 times [2022-01-10 20:08:53,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197996128] [2022-01-10 20:08:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:53,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197996128] [2022-01-10 20:08:53,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197996128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:53,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:53,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:53,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078096279] [2022-01-10 20:08:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:53,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:53,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:53,387 INFO L87 Difference]: Start difference. First operand 256 states and 356 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10 20:08:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:53,543 INFO L93 Difference]: Finished difference Result 501 states and 682 transitions. [2022-01-10 20:08:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:08:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2022-01-10 20:08:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:53,546 INFO L225 Difference]: With dead ends: 501 [2022-01-10 20:08:53,546 INFO L226 Difference]: Without dead ends: 430 [2022-01-10 20:08:53,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:08:53,547 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 295 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:53,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 800 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-01-10 20:08:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 302. [2022-01-10 20:08:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 296 states have (on average 1.4155405405405406) internal successors, (419), 301 states have internal predecessors, (419), 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-10 20:08:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 419 transitions. [2022-01-10 20:08:53,563 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 419 transitions. Word has length 30 [2022-01-10 20:08:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:53,563 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 419 transitions. [2022-01-10 20:08:53,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10 20:08:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 419 transitions. [2022-01-10 20:08:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:08:53,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,565 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] [2022-01-10 20:08:53,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:08:53,566 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 178212029, now seen corresponding path program 1 times [2022-01-10 20:08:53,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411411322] [2022-01-10 20:08:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:53,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:53,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411411322] [2022-01-10 20:08:53,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411411322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:53,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:53,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:53,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774537843] [2022-01-10 20:08:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:53,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:53,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:53,612 INFO L87 Difference]: Start difference. First operand 302 states and 419 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10 20:08:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:53,677 INFO L93 Difference]: Finished difference Result 393 states and 545 transitions. [2022-01-10 20:08:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:53,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2022-01-10 20:08:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:53,679 INFO L225 Difference]: With dead ends: 393 [2022-01-10 20:08:53,679 INFO L226 Difference]: Without dead ends: 391 [2022-01-10 20:08:53,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:08:53,680 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 121 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:53,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 587 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-01-10 20:08:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 306. [2022-01-10 20:08:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.4033333333333333) internal successors, (421), 305 states have internal predecessors, (421), 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-10 20:08:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 421 transitions. [2022-01-10 20:08:53,695 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 421 transitions. Word has length 30 [2022-01-10 20:08:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:53,696 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 421 transitions. [2022-01-10 20:08:53,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10 20:08:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 421 transitions. [2022-01-10 20:08:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:08:53,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,697 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] [2022-01-10 20:08:53,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:08:53,697 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash -717825134, now seen corresponding path program 1 times [2022-01-10 20:08:53,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474490222] [2022-01-10 20:08:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:53,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:53,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474490222] [2022-01-10 20:08:53,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474490222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:53,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:53,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:08:53,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101811107] [2022-01-10 20:08:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:53,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:08:53,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:08:53,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:08:53,761 INFO L87 Difference]: Start difference. First operand 306 states and 421 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10 20:08:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,037 INFO L93 Difference]: Finished difference Result 796 states and 1085 transitions. [2022-01-10 20:08:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:08:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2022-01-10 20:08:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,040 INFO L225 Difference]: With dead ends: 796 [2022-01-10 20:08:54,040 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 20:08:54,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:08:54,042 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 649 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:54,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 1135 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:08:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 20:08:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 358. [2022-01-10 20:08:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 352 states have (on average 1.4090909090909092) internal successors, (496), 357 states have internal predecessors, (496), 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-10 20:08:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 496 transitions. [2022-01-10 20:08:54,060 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 496 transitions. Word has length 30 [2022-01-10 20:08:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,061 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 496 transitions. [2022-01-10 20:08:54,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10 20:08:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 496 transitions. [2022-01-10 20:08:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:08:54,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,062 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] [2022-01-10 20:08:54,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:08:54,062 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-10 20:08:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -717795343, now seen corresponding path program 1 times [2022-01-10 20:08:54,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511552153] [2022-01-10 20:08:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:08:54,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:08:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:08:54,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:08:54,157 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:08:54,158 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-10 20:08:54,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-10 20:08:54,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-01-10 20:08:54,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-10 20:08:54,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-10 20:08:54,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-10 20:08:54,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:08:54,162 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:54,164 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:08:54,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:54 BasicIcfg [2022-01-10 20:08:54,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:08:54,233 INFO L158 Benchmark]: Toolchain (without parser) took 3354.46ms. Allocated memory was 221.2MB in the beginning and 269.5MB in the end (delta: 48.2MB). Free memory was 170.4MB in the beginning and 138.5MB in the end (delta: 31.9MB). Peak memory consumption was 81.0MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,233 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 221.2MB. Free memory is still 187.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:08:54,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 221.2MB. Free memory was 170.1MB in the beginning and 193.7MB in the end (delta: -23.6MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.17ms. Allocated memory is still 221.2MB. Free memory was 193.7MB in the beginning and 191.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,234 INFO L158 Benchmark]: Boogie Preprocessor took 26.79ms. Allocated memory is still 221.2MB. Free memory was 191.1MB in the beginning and 189.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,234 INFO L158 Benchmark]: RCFGBuilder took 350.09ms. Allocated memory is still 221.2MB. Free memory was 189.5MB in the beginning and 171.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,234 INFO L158 Benchmark]: IcfgTransformer took 119.01ms. Allocated memory is still 221.2MB. Free memory was 171.1MB in the beginning and 162.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,235 INFO L158 Benchmark]: TraceAbstraction took 2547.54ms. Allocated memory was 221.2MB in the beginning and 269.5MB in the end (delta: 48.2MB). Free memory was 162.2MB in the beginning and 138.5MB in the end (delta: 23.7MB). Peak memory consumption was 73.0MB. Max. memory is 8.0GB. [2022-01-10 20:08:54,236 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.11ms. Allocated memory is still 221.2MB. Free memory is still 187.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 221.2MB. Free memory was 170.1MB in the beginning and 193.7MB in the end (delta: -23.6MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.17ms. Allocated memory is still 221.2MB. Free memory was 193.7MB in the beginning and 191.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.79ms. Allocated memory is still 221.2MB. Free memory was 191.1MB in the beginning and 189.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 350.09ms. Allocated memory is still 221.2MB. Free memory was 189.5MB in the beginning and 171.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 119.01ms. Allocated memory is still 221.2MB. Free memory was 171.1MB in the beginning and 162.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2547.54ms. Allocated memory was 221.2MB in the beginning and 269.5MB in the end (delta: 48.2MB). Free memory was 162.2MB in the beginning and 138.5MB in the end (delta: 23.7MB). Peak memory consumption was 73.0MB. 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 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of BvToInt. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L252] RET, EXPR base2flt(ma, ea) [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L253] RET, EXPR base2flt(mb, eb) [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=33554432, mb=33554432, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4386 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4386 mSDsluCounter, 6097 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4847 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 1250 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=9, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2022-01-10 20:08:54,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...