/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 05:22:51,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 05:22:51,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 05:22:51,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 05:22:51,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 05:22:51,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 05:22:51,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 05:22:51,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 05:22:51,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 05:22:51,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 05:22:51,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 05:22:51,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 05:22:51,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 05:22:51,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 05:22:51,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 05:22:51,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 05:22:51,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 05:22:51,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 05:22:51,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 05:22:51,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 05:22:51,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 05:22:51,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 05:22:51,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 05:22:51,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 05:22:51,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 05:22:51,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 05:22:51,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 05:22:51,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 05:22:51,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 05:22:51,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 05:22:51,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 05:22:51,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 05:22:51,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 05:22:51,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 05:22:51,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 05:22:51,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 05:22:51,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 05:22:51,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 05:22:51,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 05:22:51,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 05:22:51,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 05:22:51,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-06 05:22:51,782 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 05:22:51,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 05:22:51,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 05:22:51,785 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 05:22:51,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 05:22:51,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 05:22:51,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 05:22:51,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 05:22:51,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 05:22:51,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 05:22:51,786 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 05:22:51,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 05:22:51,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:22:51,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 05:22:51,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 05:22:51,788 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-06 05:22:51,788 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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; [2021-05-06 05:22:52,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 05:22:52,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 05:22:52,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 05:22:52,095 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 05:22:52,096 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 05:22:52,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2021-05-06 05:22:52,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0625316/62c6c31cbaa04c888b5eeed5dcecf25a/FLAG862c2ff0a [2021-05-06 05:22:52,520 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 05:22:52,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2021-05-06 05:22:52,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0625316/62c6c31cbaa04c888b5eeed5dcecf25a/FLAG862c2ff0a [2021-05-06 05:22:52,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0625316/62c6c31cbaa04c888b5eeed5dcecf25a [2021-05-06 05:22:52,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 05:22:52,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-06 05:22:52,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 05:22:52,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 05:22:52,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 05:22:52,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:22:52" (1/1) ... [2021-05-06 05:22:52,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a31de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:52, skipping insertion in model container [2021-05-06 05:22:52,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:22:52" (1/1) ... [2021-05-06 05:22:52,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 05:22:52,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 05:22:53,074 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2021-05-06 05:22:53,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:22:53,110 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 05:22:53,117 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2021-05-06 05:22:53,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:22:53,160 INFO L208 MainTranslator]: Completed translation [2021-05-06 05:22:53,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53 WrapperNode [2021-05-06 05:22:53,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 05:22:53,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 05:22:53,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 05:22:53,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 05:22:53,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 05:22:53,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 05:22:53,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 05:22:53,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 05:22:53,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:22:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 05:22:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 05:22:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 05:22:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 05:22:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2021-05-06 05:22:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 05:22:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2021-05-06 05:22:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 05:22:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 05:22:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 05:22:53,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 05:22:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 05:22:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 05:22:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 05:22:53,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 05:22:53,701 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-05-06 05:22:53,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:22:53 BoogieIcfgContainer [2021-05-06 05:22:53,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 05:22:53,702 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-06 05:22:53,703 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-06 05:22:53,703 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-06 05:22:53,705 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:22:53" (1/1) ... [2021-05-06 05:22:53,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:22:53 BasicIcfg [2021-05-06 05:22:53,717 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-06 05:22:53,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 05:22:53,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 05:22:53,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 05:22:53,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:22:52" (1/4) ... [2021-05-06 05:22:53,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7357a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:22:53, skipping insertion in model container [2021-05-06 05:22:53,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:22:53" (2/4) ... [2021-05-06 05:22:53,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7357a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:22:53, skipping insertion in model container [2021-05-06 05:22:53,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:22:53" (3/4) ... [2021-05-06 05:22:53,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7357a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:22:53, skipping insertion in model container [2021-05-06 05:22:53,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:22:53" (4/4) ... [2021-05-06 05:22:53,722 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.cJordan [2021-05-06 05:22:53,725 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-06 05:22:53,727 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 05:22:53,737 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 05:22:53,750 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 05:22:53,750 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-06 05:22:53,750 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-06 05:22:53,751 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 05:22:53,751 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 05:22:53,751 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 05:22:53,751 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 05:22:53,751 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 05:22:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-06 05:22:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-06 05:22:53,764 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:53,764 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:53,765 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:53,768 INFO L82 PathProgramCache]: Analyzing trace with hash -708032411, now seen corresponding path program 1 times [2021-05-06 05:22:53,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:53,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853562468] [2021-05-06 05:22:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:53,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:53,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:53,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853562468] [2021-05-06 05:22:53,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853562468] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:22:53,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:22:53,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 05:22:53,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733674868] [2021-05-06 05:22:53,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 05:22:53,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 05:22:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 05:22:54,027 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:54,189 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2021-05-06 05:22:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 05:22:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-06 05:22:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:54,195 INFO L225 Difference]: With dead ends: 69 [2021-05-06 05:22:54,196 INFO L226 Difference]: Without dead ends: 24 [2021-05-06 05:22:54,197 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 05:22:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-06 05:22:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-05-06 05:22:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-05-06 05:22:54,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2021-05-06 05:22:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:54,219 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-05-06 05:22:54,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-05-06 05:22:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-06 05:22:54,219 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:54,219 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:54,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 05:22:54,220 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash -707108890, now seen corresponding path program 1 times [2021-05-06 05:22:54,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:54,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504299028] [2021-05-06 05:22:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:54,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:54,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:54,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504299028] [2021-05-06 05:22:54,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504299028] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:22:54,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:22:54,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:22:54,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076928353] [2021-05-06 05:22:54,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:22:54,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:22:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:22:54,341 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:54,452 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-05-06 05:22:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:22:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-06 05:22:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:54,457 INFO L225 Difference]: With dead ends: 26 [2021-05-06 05:22:54,458 INFO L226 Difference]: Without dead ends: 26 [2021-05-06 05:22:54,458 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:22:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-06 05:22:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2021-05-06 05:22:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-05-06 05:22:54,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2021-05-06 05:22:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:54,464 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-05-06 05:22:54,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2021-05-06 05:22:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 05:22:54,465 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:54,465 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:54,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 05:22:54,468 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash -740655430, now seen corresponding path program 1 times [2021-05-06 05:22:54,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:54,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106308571] [2021-05-06 05:22:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:54,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:54,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:54,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106308571] [2021-05-06 05:22:54,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106308571] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:54,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058704820] [2021-05-06 05:22:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:54,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 05:22:54,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:54,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:54,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:54,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:54,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058704820] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:54,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:22:54,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-05-06 05:22:54,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175356759] [2021-05-06 05:22:54,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 05:22:54,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 05:22:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:22:54,817 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:54,966 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-06 05:22:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:22:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-06 05:22:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:54,968 INFO L225 Difference]: With dead ends: 30 [2021-05-06 05:22:54,968 INFO L226 Difference]: Without dead ends: 30 [2021-05-06 05:22:54,968 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:22:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-06 05:22:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-05-06 05:22:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-06 05:22:54,973 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-05-06 05:22:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:54,973 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-06 05:22:54,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-06 05:22:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 05:22:54,975 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:54,975 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:55,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-05-06 05:22:55,191 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2075716722, now seen corresponding path program 2 times [2021-05-06 05:22:55,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:55,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813107376] [2021-05-06 05:22:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:55,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:55,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:55,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813107376] [2021-05-06 05:22:55,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813107376] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:55,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026883615] [2021-05-06 05:22:55,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:55,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 05:22:55,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 05:22:55,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-06 05:22:55,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:55,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:55,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026883615] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:22:55,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-06 05:22:55,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-05-06 05:22:55,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539191928] [2021-05-06 05:22:55,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:22:55,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:22:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:22:55,476 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:55,500 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-05-06 05:22:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:22:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-06 05:22:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:55,501 INFO L225 Difference]: With dead ends: 38 [2021-05-06 05:22:55,501 INFO L226 Difference]: Without dead ends: 38 [2021-05-06 05:22:55,501 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 78.0ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:22:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-06 05:22:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2021-05-06 05:22:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-05-06 05:22:55,504 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2021-05-06 05:22:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:55,509 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-05-06 05:22:55,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-05-06 05:22:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 05:22:55,510 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:55,510 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:55,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:55,722 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -332906387, now seen corresponding path program 1 times [2021-05-06 05:22:55,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:55,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218416831] [2021-05-06 05:22:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:55,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:55,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:55,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218416831] [2021-05-06 05:22:55,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218416831] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:55,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614556854] [2021-05-06 05:22:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-06 05:22:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:55,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:55,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614556854] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:55,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:22:55,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-05-06 05:22:55,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928730791] [2021-05-06 05:22:55,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 05:22:55,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 05:22:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:22:55,945 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:56,064 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-05-06 05:22:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 05:22:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-06 05:22:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:56,068 INFO L225 Difference]: With dead ends: 49 [2021-05-06 05:22:56,068 INFO L226 Difference]: Without dead ends: 49 [2021-05-06 05:22:56,068 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 124.9ms TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-05-06 05:22:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-06 05:22:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2021-05-06 05:22:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2021-05-06 05:22:56,080 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2021-05-06 05:22:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:56,081 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2021-05-06 05:22:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2021-05-06 05:22:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 05:22:56,081 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:56,081 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:56,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:56,289 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:56,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1081610080, now seen corresponding path program 2 times [2021-05-06 05:22:56,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:56,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684857290] [2021-05-06 05:22:56,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:56,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:56,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:56,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684857290] [2021-05-06 05:22:56,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684857290] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:56,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368839990] [2021-05-06 05:22:56,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:56,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-06 05:22:56,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 05:22:56,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-06 05:22:56,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:56,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:56,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368839990] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:56,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:22:56,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-05-06 05:22:56,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832190801] [2021-05-06 05:22:56,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 05:22:56,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 05:22:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-05-06 05:22:56,729 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:56,879 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-05-06 05:22:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 05:22:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-06 05:22:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:56,880 INFO L225 Difference]: With dead ends: 57 [2021-05-06 05:22:56,881 INFO L226 Difference]: Without dead ends: 57 [2021-05-06 05:22:56,881 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 197.6ms TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2021-05-06 05:22:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-06 05:22:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-05-06 05:22:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-05-06 05:22:56,884 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 24 [2021-05-06 05:22:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:56,884 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-05-06 05:22:56,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-05-06 05:22:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-06 05:22:56,884 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:56,884 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:57,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:57,093 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:57,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2120109907, now seen corresponding path program 3 times [2021-05-06 05:22:57,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:57,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111444773] [2021-05-06 05:22:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:57,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:57,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:57,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111444773] [2021-05-06 05:22:57,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111444773] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:57,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969771597] [2021-05-06 05:22:57,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:57,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-05-06 05:22:57,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 05:22:57,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 05:22:57,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:57,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:57,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969771597] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:57,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:22:57,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-06 05:22:57,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325720649] [2021-05-06 05:22:57,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 05:22:57,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 05:22:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-06 05:22:57,394 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:57,554 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-05-06 05:22:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 05:22:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-05-06 05:22:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:57,555 INFO L225 Difference]: With dead ends: 65 [2021-05-06 05:22:57,555 INFO L226 Difference]: Without dead ends: 65 [2021-05-06 05:22:57,555 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 167.4ms TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2021-05-06 05:22:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-06 05:22:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2021-05-06 05:22:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2021-05-06 05:22:57,558 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 28 [2021-05-06 05:22:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:57,558 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2021-05-06 05:22:57,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2021-05-06 05:22:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-06 05:22:57,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:57,559 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:57,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-06 05:22:57,765 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 414194822, now seen corresponding path program 4 times [2021-05-06 05:22:57,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:57,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918573849] [2021-05-06 05:22:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:57,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:22:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:22:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:57,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:22:57,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918573849] [2021-05-06 05:22:57,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918573849] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:57,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821197173] [2021-05-06 05:22:57,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:57,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-06 05:22:57,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-06 05:22:57,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-06 05:22:57,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:22:57,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:57,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:22:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:22:58,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821197173] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:22:58,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:22:58,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-05-06 05:22:58,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395918314] [2021-05-06 05:22:58,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 05:22:58,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:22:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 05:22:58,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2021-05-06 05:22:58,053 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:22:58,211 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2021-05-06 05:22:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 05:22:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-06 05:22:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:22:58,212 INFO L225 Difference]: With dead ends: 73 [2021-05-06 05:22:58,212 INFO L226 Difference]: Without dead ends: 73 [2021-05-06 05:22:58,212 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 172.7ms TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2021-05-06 05:22:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-06 05:22:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-05-06 05:22:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 05:22:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-05-06 05:22:58,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 32 [2021-05-06 05:22:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:22:58,215 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-05-06 05:22:58,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:22:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2021-05-06 05:22:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-06 05:22:58,215 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:22:58,215 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:22:58,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:22:58,429 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:22:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:22:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1847728185, now seen corresponding path program 5 times [2021-05-06 05:22:58,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:22:58,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945548743] [2021-05-06 05:22:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:22:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 05:22:58,442 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 05:22:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 05:22:58,459 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 05:22:58,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-06 05:22:58,488 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-06 05:22:58,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 05:22:58,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:22:58 BasicIcfg [2021-05-06 05:22:58,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 05:22:58,531 INFO L168 Benchmark]: Toolchain (without parser) took 5600.86 ms. Allocated memory was 197.1 MB in the beginning and 273.7 MB in the end (delta: 76.5 MB). Free memory was 162.0 MB in the beginning and 209.8 MB in the end (delta: -47.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,531 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 197.1 MB. Free memory is still 178.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 05:22:58,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.48 ms. Allocated memory is still 197.1 MB. Free memory was 161.8 MB in the beginning and 180.0 MB in the end (delta: -18.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,531 INFO L168 Benchmark]: Boogie Preprocessor took 52.11 ms. Allocated memory is still 197.1 MB. Free memory was 180.0 MB in the beginning and 177.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,531 INFO L168 Benchmark]: RCFGBuilder took 481.78 ms. Allocated memory is still 197.1 MB. Free memory was 177.5 MB in the beginning and 149.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,532 INFO L168 Benchmark]: IcfgTransformer took 14.64 ms. Allocated memory is still 197.1 MB. Free memory was 149.2 MB in the beginning and 147.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,532 INFO L168 Benchmark]: TraceAbstraction took 4812.67 ms. Allocated memory was 197.1 MB in the beginning and 273.7 MB in the end (delta: 76.5 MB). Free memory was 146.7 MB in the beginning and 209.8 MB in the end (delta: -63.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 8.0 GB. [2021-05-06 05:22:58,532 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.09 ms. Allocated memory is still 197.1 MB. Free memory is still 178.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 229.48 ms. Allocated memory is still 197.1 MB. Free memory was 161.8 MB in the beginning and 180.0 MB in the end (delta: -18.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.11 ms. Allocated memory is still 197.1 MB. Free memory was 180.0 MB in the beginning and 177.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 481.78 ms. Allocated memory is still 197.1 MB. Free memory was 177.5 MB in the beginning and 149.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. * IcfgTransformer took 14.64 ms. Allocated memory is still 197.1 MB. Free memory was 149.2 MB in the beginning and 147.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4812.67 ms. Allocated memory was 197.1 MB in the beginning and 273.7 MB in the end (delta: 76.5 MB). Free memory was 146.7 MB in the beginning and 209.8 MB in the end (delta: -63.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; VAL [\old(a)=20011, \old(a)=20027, \old(b)=20021, \old(b)=20015, \old(x)=20001, \old(x)=20003, a={5:0}, b={6:0}, x={3:0}] [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, n=5, nmax=50, x={3:0}] [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={3:0}] [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={3:0}] [L99] COND FALSE !(i == j) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={3:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={3:0}] [L99] COND FALSE !(i == j) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={3:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={3:0}] [L99] COND FALSE !(i == j) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={3:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={3:0}] [L99] COND FALSE !(i == j) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={3:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={3:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={3:0}] [L99] COND FALSE !(i == j) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={3:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={3:0}] [L96] COND FALSE !(j <= n) VAL [a={5:0}, b={6:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={3:0}] [L102] CALL __VERIFIER_assert(i==2) VAL [\old(cond)=0, a={5:0}, b={6:0}, x={3:0}] [L6] COND TRUE !(cond) VAL [\old(cond)=0, a={5:0}, b={6:0}, cond=0, x={3:0}] [L7] reach_error() VAL [\old(cond)=0, a={5:0}, b={6:0}, cond=0, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4742.6ms, OverallIterations: 9, TraceHistogramMax: 6, EmptinessCheckTime: 12.0ms, AutomataDifference: 1089.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 182 SDtfs, 304 SDslu, 245 SDs, 0 SdLazy, 534 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 443.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1003.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 46.4ms AutomataMinimizationTime, 8 MinimizatonAttempts, 41 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 92.1ms SsaConstructionTime, 230.7ms SatisfiabilityAnalysisTime, 1550.2ms InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 1490 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 10/202 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 Received shutdown request...