/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_3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:55,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:55,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:55,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:55,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:55,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:55,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:56,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:56,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:56,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:56,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:56,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:56,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:56,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:56,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:56,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:56,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:56,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:56,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:56,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:56,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:56,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:56,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:56,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:56,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:56,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:56,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:56,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:56,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:56,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:56,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:56,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:56,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:56,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:56,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:56,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:56,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:56,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:56,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:56,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:56,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:56,046 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:56,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:56,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:56,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:56,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:56,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:56,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:56,061 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:56,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:56,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:56,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:56,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:56,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:56,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:56,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:56,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:56,064 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:56,064 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:56,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:56,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:56,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:56,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:56,227 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:56,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2022-01-10 20:08:56,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3c3961/431249f6bbab4dd69e54aa11a0a33a5c/FLAGe2be0d742 [2022-01-10 20:08:56,619 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:56,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2022-01-10 20:08:56,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3c3961/431249f6bbab4dd69e54aa11a0a33a5c/FLAGe2be0d742 [2022-01-10 20:08:56,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3c3961/431249f6bbab4dd69e54aa11a0a33a5c [2022-01-10 20:08:56,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:56,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:56,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:56,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:56,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:56,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:56" (1/1) ... [2022-01-10 20:08:56,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd4375f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:56, skipping insertion in model container [2022-01-10 20:08:56,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:56" (1/1) ... [2022-01-10 20:08:56,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:56,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:56,759 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_3a.c.cil.c[728,741] [2022-01-10 20:08:56,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:56,812 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:56,820 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_3a.c.cil.c[728,741] [2022-01-10 20:08:56,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:56,846 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:56,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:56 WrapperNode [2022-01-10 20:08:56,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:56,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:56,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:56,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:56,853 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:56" (1/1) ... [2022-01-10 20:08:56,859 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:56" (1/1) ... [2022-01-10 20:08:56,874 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 276 [2022-01-10 20:08:56,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:56,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:56,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:56,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:56,881 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:56" (1/1) ... [2022-01-10 20:08:56,881 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:56" (1/1) ... [2022-01-10 20:08:56,884 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:56" (1/1) ... [2022-01-10 20:08:56,884 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:56" (1/1) ... [2022-01-10 20:08:56,889 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:56" (1/1) ... [2022-01-10 20:08:56,893 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:56" (1/1) ... [2022-01-10 20:08:56,895 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:56" (1/1) ... [2022-01-10 20:08:56,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:56,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:56,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:56,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:56,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:56" (1/1) ... [2022-01-10 20:08:56,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:56,928 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:56,930 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:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:56,996 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:56,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:57,236 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:57,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:57,242 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 20:08:57,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:57 BoogieIcfgContainer [2022-01-10 20:08:57,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:57,244 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:57,244 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:57,245 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:57,247 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:57" (1/1) ... [2022-01-10 20:08:57,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:57 BasicIcfg [2022-01-10 20:08:57,365 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:57,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:57,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:57,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:57,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:56" (1/4) ... [2022-01-10 20:08:57,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4a70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:57, skipping insertion in model container [2022-01-10 20:08:57,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:56" (2/4) ... [2022-01-10 20:08:57,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4a70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:57, skipping insertion in model container [2022-01-10 20:08:57,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:57" (3/4) ... [2022-01-10 20:08:57,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4a70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:57, skipping insertion in model container [2022-01-10 20:08:57,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:57" (4/4) ... [2022-01-10 20:08:57,370 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.cTransformedIcfg [2022-01-10 20:08:57,374 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:57,374 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:08:57,414 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:57,421 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:57,422 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:08:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 71 states have internal predecessors, (124), 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:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 20:08:57,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:57,441 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] [2022-01-10 20:08:57,442 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:57,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash 611487743, now seen corresponding path program 1 times [2022-01-10 20:08:57,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031087530] [2022-01-10 20:08:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:57,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:57,653 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:57,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031087530] [2022-01-10 20:08:57,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031087530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:57,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:57,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:57,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094044044] [2022-01-10 20:08:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:57,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:57,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:57,685 INFO L87 Difference]: Start difference. First operand has 72 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 71 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:57,790 INFO L93 Difference]: Finished difference Result 135 states and 228 transitions. [2022-01-10 20:08:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-01-10 20:08:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:57,807 INFO L225 Difference]: With dead ends: 135 [2022-01-10 20:08:57,808 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 20:08:57,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:57,812 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:57,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 155 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 20:08:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2022-01-10 20:08:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.492063492063492) internal successors, (94), 63 states have internal predecessors, (94), 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:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2022-01-10 20:08:57,839 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 24 [2022-01-10 20:08:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:57,839 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2022-01-10 20:08:57,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2022-01-10 20:08:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 20:08:57,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:57,840 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] [2022-01-10 20:08:57,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:57,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -530159138, now seen corresponding path program 1 times [2022-01-10 20:08:57,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:57,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350830502] [2022-01-10 20:08:57,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:57,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:57,900 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:57,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350830502] [2022-01-10 20:08:57,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350830502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:57,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:57,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:57,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623028572] [2022-01-10 20:08:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:57,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:57,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:57,902 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:57,911 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2022-01-10 20:08:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-01-10 20:08:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:57,914 INFO L225 Difference]: With dead ends: 72 [2022-01-10 20:08:57,914 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 20:08:57,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:57,917 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:57,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 20:08:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-01-10 20:08:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 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:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2022-01-10 20:08:57,923 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 27 [2022-01-10 20:08:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:57,923 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2022-01-10 20:08:57,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2022-01-10 20:08:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 20:08:57,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:57,924 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] [2022-01-10 20:08:57,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:57,925 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1802121558, now seen corresponding path program 1 times [2022-01-10 20:08:57,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:57,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219363385] [2022-01-10 20:08:57,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:57,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:57,967 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:57,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:57,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219363385] [2022-01-10 20:08:57,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219363385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:57,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:57,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:57,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139909845] [2022-01-10 20:08:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:57,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:57,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:57,969 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,001 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2022-01-10 20:08:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-01-10 20:08:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,002 INFO L225 Difference]: With dead ends: 127 [2022-01-10 20:08:58,002 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 20:08:58,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:58,003 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 159 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 20:08:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-01-10 20:08:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 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:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-01-10 20:08:58,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 29 [2022-01-10 20:08:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,009 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-01-10 20:08:58,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-01-10 20:08:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 20:08:58,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:08:58,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1552418962, now seen corresponding path program 1 times [2022-01-10 20:08:58,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349682994] [2022-01-10 20:08:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,109 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:58,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349682994] [2022-01-10 20:08:58,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349682994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:58,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186742941] [2022-01-10 20:08:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:58,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:58,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:58,112 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,234 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2022-01-10 20:08:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:08:58,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2022-01-10 20:08:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,235 INFO L225 Difference]: With dead ends: 167 [2022-01-10 20:08:58,235 INFO L226 Difference]: Without dead ends: 163 [2022-01-10 20:08:58,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:08:58,236 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 221 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 397 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-10 20:08:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 99. [2022-01-10 20:08:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 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:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2022-01-10 20:08:58,246 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 31 [2022-01-10 20:08:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,246 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2022-01-10 20:08:58,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2022-01-10 20:08:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 20:08:58,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:08:58,248 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1491351416, now seen corresponding path program 1 times [2022-01-10 20:08:58,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022398091] [2022-01-10 20:08:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,336 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:58,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022398091] [2022-01-10 20:08:58,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022398091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:58,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006130296] [2022-01-10 20:08:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:58,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:58,339 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,428 INFO L93 Difference]: Finished difference Result 177 states and 253 transitions. [2022-01-10 20:08:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:08:58,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2022-01-10 20:08:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,430 INFO L225 Difference]: With dead ends: 177 [2022-01-10 20:08:58,430 INFO L226 Difference]: Without dead ends: 143 [2022-01-10 20:08:58,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:08:58,431 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 292 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-10 20:08:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 105. [2022-01-10 20:08:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 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:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2022-01-10 20:08:58,439 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 33 [2022-01-10 20:08:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,440 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2022-01-10 20:08:58,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2022-01-10 20:08:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 20:08:58,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:08:58,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1996910041, now seen corresponding path program 1 times [2022-01-10 20:08:58,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539125696] [2022-01-10 20:08:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,493 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:58,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539125696] [2022-01-10 20:08:58,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539125696] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:58,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154795322] [2022-01-10 20:08:58,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:58,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:58,496 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,561 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-01-10 20:08:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2022-01-10 20:08:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,564 INFO L225 Difference]: With dead ends: 135 [2022-01-10 20:08:58,564 INFO L226 Difference]: Without dead ends: 130 [2022-01-10 20:08:58,565 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:58,565 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 95 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 385 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-10 20:08:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2022-01-10 20:08:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.403361344537815) internal successors, (167), 119 states have internal predecessors, (167), 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:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2022-01-10 20:08:58,574 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 33 [2022-01-10 20:08:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,574 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2022-01-10 20:08:58,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2022-01-10 20:08:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 20:08:58,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:08:58,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1995986520, now seen corresponding path program 1 times [2022-01-10 20:08:58,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980194048] [2022-01-10 20:08:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,652 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:58,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980194048] [2022-01-10 20:08:58,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980194048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:58,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606086054] [2022-01-10 20:08:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:58,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:58,655 INFO L87 Difference]: Start difference. First operand 120 states and 167 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,688 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2022-01-10 20:08:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:08:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2022-01-10 20:08:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,691 INFO L225 Difference]: With dead ends: 125 [2022-01-10 20:08:58,691 INFO L226 Difference]: Without dead ends: 112 [2022-01-10 20:08:58,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:08:58,694 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 359 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-10 20:08:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-01-10 20:08:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 111 states have internal predecessors, (154), 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:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2022-01-10 20:08:58,713 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 33 [2022-01-10 20:08:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,714 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2022-01-10 20:08:58,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2022-01-10 20:08:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:08:58,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:08:58,715 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1854725646, now seen corresponding path program 1 times [2022-01-10 20:08:58,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364255274] [2022-01-10 20:08:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,777 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:58,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364255274] [2022-01-10 20:08:58,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364255274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:58,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54362029] [2022-01-10 20:08:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:58,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:58,779 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,837 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2022-01-10 20:08:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:08:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-01-10 20:08:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,838 INFO L225 Difference]: With dead ends: 179 [2022-01-10 20:08:58,838 INFO L226 Difference]: Without dead ends: 136 [2022-01-10 20:08:58,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:08:58,840 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 55 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 339 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-10 20:08:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2022-01-10 20:08:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 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:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2022-01-10 20:08:58,860 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 34 [2022-01-10 20:08:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,861 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2022-01-10 20:08:58,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2022-01-10 20:08:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 20:08:58,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:08:58,862 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 366780026, now seen corresponding path program 1 times [2022-01-10 20:08:58,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495676116] [2022-01-10 20:08:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:08:58,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:08:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:08:58,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:08:58,953 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:08:58,964 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 20:08:58,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:08:58,967 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:58,969 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:08:59,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:59 BasicIcfg [2022-01-10 20:08:59,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:08:59,021 INFO L158 Benchmark]: Toolchain (without parser) took 2384.59ms. Allocated memory was 255.9MB in the beginning and 416.3MB in the end (delta: 160.4MB). Free memory was 199.3MB in the beginning and 192.7MB in the end (delta: 6.7MB). Peak memory consumption was 166.4MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,021 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 215.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:08:59,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.12ms. Allocated memory was 255.9MB in the beginning and 416.3MB in the end (delta: 160.4MB). Free memory was 199.1MB in the beginning and 384.0MB in the end (delta: -184.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 416.3MB. Free memory was 384.0MB in the beginning and 382.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,021 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 416.3MB. Free memory was 382.0MB in the beginning and 379.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,022 INFO L158 Benchmark]: RCFGBuilder took 345.42ms. Allocated memory is still 416.3MB. Free memory was 379.9MB in the beginning and 362.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,022 INFO L158 Benchmark]: IcfgTransformer took 121.34ms. Allocated memory is still 416.3MB. Free memory was 362.0MB in the beginning and 354.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,022 INFO L158 Benchmark]: TraceAbstraction took 1654.34ms. Allocated memory is still 416.3MB. Free memory was 354.2MB in the beginning and 192.7MB in the end (delta: 161.5MB). Peak memory consumption was 161.5MB. Max. memory is 8.0GB. [2022-01-10 20:08:59,025 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.09ms. Allocated memory is still 255.9MB. Free memory is still 215.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.12ms. Allocated memory was 255.9MB in the beginning and 416.3MB in the end (delta: 160.4MB). Free memory was 199.1MB in the beginning and 384.0MB in the end (delta: -184.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 416.3MB. Free memory was 384.0MB in the beginning and 382.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 416.3MB. Free memory was 382.0MB in the beginning and 379.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.42ms. Allocated memory is still 416.3MB. Free memory was 379.9MB in the beginning and 362.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 121.34ms. Allocated memory is still 416.3MB. Free memory was 362.0MB in the beginning and 354.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 1654.34ms. Allocated memory is still 416.3MB. Free memory was 354.2MB in the beginning and 192.7MB in the end (delta: 161.5MB). Peak memory consumption was 161.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; [L238] 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] [L238] RET, EXPR base2flt(0, 0) [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=4294967295, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=4294967295, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=0, e=4294967295, m=0, res=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=0, __retres4=0, e=4294967295, m=0, res=0] [L239] RET, EXPR base2flt(1, 0) [L239] one = base2flt(1, 0) [L240] 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] [L240] RET, EXPR base2flt(ma, ea) [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) [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] [L241] RET, EXPR base2flt(mb, eb) [L241] b = base2flt(mb, eb) [L242] CALL, EXPR mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0] [L158] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0] [L165] COND TRUE ! b [L166] __retres10 = 0U VAL [\old(a)=4294967295, \old(b)=0, __retres10=0, a=4294967295, b=0] [L217] return (__retres10); VAL [\old(a)=4294967295, \old(b)=0, \result=0, __retres10=0, a=4294967295, b=0] [L242] RET, EXPR mulflt(a, b) [L242] r_mul = mulflt(a, b) [L244] COND FALSE !(b < one) VAL [a=4294967295, b=0, ea=127, eb=0, ma=33554432, mb=0, one=0, r_mul=0, zero=0] [L247] COND FALSE !(b > one) [L250] tmp = 0 VAL [a=4294967295, b=0, ea=127, eb=0, ma=33554432, mb=0, one=0, r_mul=0, tmp=0, zero=0] [L252] sb = tmp VAL [a=4294967295, b=0, ea=127, eb=0, ma=33554432, mb=0, one=0, r_mul=0, sb=0, tmp=0, zero=0] [L254] COND TRUE sb == 0 VAL [a=4294967295, b=0, ea=127, eb=0, ma=33554432, mb=0, one=0, r_mul=0, sb=0, tmp=0, zero=0] [L255] COND TRUE r_mul < a [L256] tmp___1 = -1 VAL [a=4294967295, b=0, ea=127, eb=0, ma=33554432, mb=0, one=0, r_mul=0, sb=0, tmp=0, tmp___1=4294967295, zero=0] [L266] CALL __VERIFIER_assert(tmp___1 == 0) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 510 mSDsluCounter, 2270 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1559 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 711 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 145 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:59,057 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...