/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 07:28:30,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 07:28:30,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 07:28:30,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 07:28:30,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 07:28:30,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 07:28:30,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 07:28:30,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 07:28:30,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 07:28:30,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 07:28:30,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 07:28:30,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 07:28:30,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 07:28:30,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 07:28:30,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 07:28:30,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 07:28:30,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 07:28:30,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 07:28:30,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 07:28:30,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 07:28:30,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 07:28:30,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 07:28:30,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 07:28:30,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 07:28:30,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 07:28:30,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 07:28:30,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 07:28:30,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 07:28:30,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 07:28:30,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 07:28:30,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 07:28:30,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 07:28:30,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 07:28:30,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 07:28:30,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 07:28:30,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 07:28:30,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 07:28:30,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 07:28:30,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 07:28:30,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 07:28:30,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 07:28:30,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 07:28:31,028 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 07:28:31,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 07:28:31,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 07:28:31,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 07:28:31,034 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 07:28:31,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 07:28:31,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 07:28:31,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 07:28:31,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 07:28:31,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 07:28:31,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 07:28:31,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 07:28:31,038 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 07:28:31,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 07:28:31,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 07:28:31,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 07:28:31,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 07:28:31,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 07:28:31,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 07:28:31,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 07:28:31,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 07:28:31,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 07:28:31,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 07:28:31,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 07:28:31,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 07:28:31,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2020-12-23 07:28:31,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 07:28:31,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 07:28:31,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 07:28:31,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 07:28:31,478 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 07:28:31,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2020-12-23 07:28:31,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2cd902383/d2072cac454f4ea5a31d622eb803aa78/FLAG078a8df88 [2020-12-23 07:28:32,212 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 07:28:32,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2020-12-23 07:28:32,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2cd902383/d2072cac454f4ea5a31d622eb803aa78/FLAG078a8df88 [2020-12-23 07:28:32,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2cd902383/d2072cac454f4ea5a31d622eb803aa78 [2020-12-23 07:28:32,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 07:28:32,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 07:28:32,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 07:28:32,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 07:28:32,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 07:28:32,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e857e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32, skipping insertion in model container [2020-12-23 07:28:32,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 07:28:32,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 07:28:32,801 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] [2020-12-23 07:28:32,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 07:28:32,836 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 07:28:32,847 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] [2020-12-23 07:28:32,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 07:28:32,873 INFO L208 MainTranslator]: Completed translation [2020-12-23 07:28:32,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32 WrapperNode [2020-12-23 07:28:32,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 07:28:32,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 07:28:32,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 07:28:32,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 07:28:32,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 07:28:32,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 07:28:32,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 07:28:32,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 07:28:32,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... [2020-12-23 07:28:32,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 07:28:32,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 07:28:32,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 07:28:32,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 07:28:32,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 07:28:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 07:28:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 07:28:33,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 07:28:33,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 07:28:33,635 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-23 07:28:33,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:28:33 BoogieIcfgContainer [2020-12-23 07:28:33,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 07:28:33,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 07:28:33,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 07:28:33,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 07:28:33,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:28:32" (1/3) ... [2020-12-23 07:28:33,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d6f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:28:33, skipping insertion in model container [2020-12-23 07:28:33,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:28:32" (2/3) ... [2020-12-23 07:28:33,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343d6f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:28:33, skipping insertion in model container [2020-12-23 07:28:33,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:28:33" (3/3) ... [2020-12-23 07:28:33,646 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound5.c [2020-12-23 07:28:33,654 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 07:28:33,660 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-23 07:28:33,681 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 07:28:33,711 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 07:28:33,711 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 07:28:33,711 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 07:28:33,712 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 07:28:33,712 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 07:28:33,712 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 07:28:33,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 07:28:33,712 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 07:28:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-12-23 07:28:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 07:28:33,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:33,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:33,737 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2020-12-23 07:28:33,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:33,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874210193] [2020-12-23 07:28:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:33,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874210193] [2020-12-23 07:28:33,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:28:33,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 07:28:33,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069971231] [2020-12-23 07:28:33,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 07:28:33,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 07:28:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 07:28:33,947 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2020-12-23 07:28:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:33,972 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2020-12-23 07:28:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 07:28:33,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-23 07:28:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:33,984 INFO L225 Difference]: With dead ends: 83 [2020-12-23 07:28:33,984 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 07:28:33,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 07:28:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 07:28:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-12-23 07:28:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-23 07:28:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-12-23 07:28:34,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2020-12-23 07:28:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:34,031 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-12-23 07:28:34,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 07:28:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-12-23 07:28:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 07:28:34,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:34,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:34,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 07:28:34,033 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2020-12-23 07:28:34,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:34,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913655178] [2020-12-23 07:28:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:34,057 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:34,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376229468] [2020-12-23 07:28:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:34,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 07:28:34,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:34,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913655178] [2020-12-23 07:28:34,428 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:34,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376229468] [2020-12-23 07:28:34,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:28:34,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 07:28:34,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914700828] [2020-12-23 07:28:34,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 07:28:34,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:34,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 07:28:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:28:34,432 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2020-12-23 07:28:34,870 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2020-12-23 07:28:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:35,048 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-12-23 07:28:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 07:28:35,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-12-23 07:28:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:35,051 INFO L225 Difference]: With dead ends: 52 [2020-12-23 07:28:35,051 INFO L226 Difference]: Without dead ends: 50 [2020-12-23 07:28:35,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-23 07:28:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-23 07:28:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2020-12-23 07:28:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-23 07:28:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-12-23 07:28:35,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2020-12-23 07:28:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:35,062 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-12-23 07:28:35,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 07:28:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-12-23 07:28:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 07:28:35,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:35,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:35,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 07:28:35,280 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2020-12-23 07:28:35,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:35,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513387914] [2020-12-23 07:28:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:35,300 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:35,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894329661] [2020-12-23 07:28:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:35,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 07:28:35,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:35,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513387914] [2020-12-23 07:28:35,737 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:35,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894329661] [2020-12-23 07:28:35,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:28:35,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 07:28:35,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886728598] [2020-12-23 07:28:35,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 07:28:35,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 07:28:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-23 07:28:35,749 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2020-12-23 07:28:36,116 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2020-12-23 07:28:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:36,451 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-12-23 07:28:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 07:28:36,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-12-23 07:28:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:36,456 INFO L225 Difference]: With dead ends: 70 [2020-12-23 07:28:36,456 INFO L226 Difference]: Without dead ends: 60 [2020-12-23 07:28:36,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-12-23 07:28:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-23 07:28:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2020-12-23 07:28:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-23 07:28:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-12-23 07:28:36,483 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 13 [2020-12-23 07:28:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:36,484 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-12-23 07:28:36,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 07:28:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-12-23 07:28:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 07:28:36,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:36,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:36,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:36,701 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2020-12-23 07:28:36,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:36,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373164910] [2020-12-23 07:28:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:36,721 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:36,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920799492] [2020-12-23 07:28:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:36,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 07:28:36,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:36,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373164910] [2020-12-23 07:28:36,831 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:36,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920799492] [2020-12-23 07:28:36,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 07:28:36,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 07:28:36,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070215084] [2020-12-23 07:28:36,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 07:28:36,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 07:28:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 07:28:36,835 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2020-12-23 07:28:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:36,981 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-12-23 07:28:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 07:28:36,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 07:28:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:36,983 INFO L225 Difference]: With dead ends: 95 [2020-12-23 07:28:36,983 INFO L226 Difference]: Without dead ends: 89 [2020-12-23 07:28:36,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 07:28:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-23 07:28:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2020-12-23 07:28:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-23 07:28:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-12-23 07:28:37,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 16 [2020-12-23 07:28:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:37,002 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-12-23 07:28:37,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 07:28:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-12-23 07:28:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 07:28:37,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:37,004 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:37,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:37,219 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2020-12-23 07:28:37,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:37,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758682160] [2020-12-23 07:28:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:37,237 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:37,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257084252] [2020-12-23 07:28:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:37,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 07:28:37,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:37,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758682160] [2020-12-23 07:28:37,519 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:37,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257084252] [2020-12-23 07:28:37,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:37,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-12-23 07:28:37,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159764060] [2020-12-23 07:28:37,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 07:28:37,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 07:28:37,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-23 07:28:37,521 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 12 states. [2020-12-23 07:28:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:38,263 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2020-12-23 07:28:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 07:28:38,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 07:28:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:38,265 INFO L225 Difference]: With dead ends: 181 [2020-12-23 07:28:38,265 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 07:28:38,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2020-12-23 07:28:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 07:28:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 103. [2020-12-23 07:28:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-23 07:28:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2020-12-23 07:28:38,286 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 25 [2020-12-23 07:28:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:38,286 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2020-12-23 07:28:38,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 07:28:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-12-23 07:28:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 07:28:38,288 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:38,288 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:38,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:38,502 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2020-12-23 07:28:38,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:38,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386527471] [2020-12-23 07:28:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:38,519 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:38,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451266102] [2020-12-23 07:28:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 07:28:38,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:38,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386527471] [2020-12-23 07:28:38,746 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:38,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451266102] [2020-12-23 07:28:38,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:38,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 07:28:38,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944447990] [2020-12-23 07:28:38,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 07:28:38,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 07:28:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:28:38,749 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 9 states. [2020-12-23 07:28:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:39,179 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2020-12-23 07:28:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 07:28:39,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-12-23 07:28:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:39,182 INFO L225 Difference]: With dead ends: 181 [2020-12-23 07:28:39,183 INFO L226 Difference]: Without dead ends: 109 [2020-12-23 07:28:39,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-12-23 07:28:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-23 07:28:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2020-12-23 07:28:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-23 07:28:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2020-12-23 07:28:39,226 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 26 [2020-12-23 07:28:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:39,226 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2020-12-23 07:28:39,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 07:28:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2020-12-23 07:28:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 07:28:39,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:39,228 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:39,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 07:28:39,443 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:39,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2020-12-23 07:28:39,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:39,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066764027] [2020-12-23 07:28:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:39,467 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:39,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043058906] [2020-12-23 07:28:39,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 07:28:39,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:28:39,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:28:39,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 07:28:39,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:39,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066764027] [2020-12-23 07:28:39,808 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:39,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043058906] [2020-12-23 07:28:39,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:39,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-12-23 07:28:39,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559284965] [2020-12-23 07:28:39,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 07:28:39,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 07:28:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-23 07:28:39,811 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 13 states. [2020-12-23 07:28:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:40,584 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2020-12-23 07:28:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 07:28:40,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-12-23 07:28:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:40,587 INFO L225 Difference]: With dead ends: 191 [2020-12-23 07:28:40,587 INFO L226 Difference]: Without dead ends: 140 [2020-12-23 07:28:40,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2020-12-23 07:28:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-23 07:28:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2020-12-23 07:28:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-23 07:28:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-12-23 07:28:40,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 34 [2020-12-23 07:28:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:40,619 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-12-23 07:28:40,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 07:28:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-12-23 07:28:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 07:28:40,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:40,624 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:40,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:40,840 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2020-12-23 07:28:40,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:40,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590186905] [2020-12-23 07:28:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:40,870 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:40,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93472581] [2020-12-23 07:28:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 07:28:40,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2020-12-23 07:28:40,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:41,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590186905] [2020-12-23 07:28:41,571 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:41,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93472581] [2020-12-23 07:28:41,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:41,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-12-23 07:28:41,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792713448] [2020-12-23 07:28:41,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 07:28:41,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 07:28:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-12-23 07:28:41,574 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 16 states. [2020-12-23 07:28:42,554 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-12-23 07:28:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:43,083 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-12-23 07:28:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 07:28:43,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2020-12-23 07:28:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:43,086 INFO L225 Difference]: With dead ends: 123 [2020-12-23 07:28:43,086 INFO L226 Difference]: Without dead ends: 113 [2020-12-23 07:28:43,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2020-12-23 07:28:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-23 07:28:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2020-12-23 07:28:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-23 07:28:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2020-12-23 07:28:43,116 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 35 [2020-12-23 07:28:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:43,116 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2020-12-23 07:28:43,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 07:28:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2020-12-23 07:28:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 07:28:43,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:43,123 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:43,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:43,338 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2020-12-23 07:28:43,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:43,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875274304] [2020-12-23 07:28:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:43,357 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:43,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083974282] [2020-12-23 07:28:43,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:43,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 07:28:43,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:28:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-23 07:28:43,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:43,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875274304] [2020-12-23 07:28:43,828 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:43,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083974282] [2020-12-23 07:28:43,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:43,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-12-23 07:28:43,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447196440] [2020-12-23 07:28:43,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 07:28:43,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 07:28:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-12-23 07:28:43,831 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 14 states. [2020-12-23 07:28:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:44,791 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2020-12-23 07:28:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 07:28:44,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2020-12-23 07:28:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:44,792 INFO L225 Difference]: With dead ends: 152 [2020-12-23 07:28:44,793 INFO L226 Difference]: Without dead ends: 142 [2020-12-23 07:28:44,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2020-12-23 07:28:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-23 07:28:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2020-12-23 07:28:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-23 07:28:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2020-12-23 07:28:44,810 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 44 [2020-12-23 07:28:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:44,811 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2020-12-23 07:28:44,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 07:28:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-12-23 07:28:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 07:28:44,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:44,812 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:45,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 07:28:45,027 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2020-12-23 07:28:45,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:45,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905901762] [2020-12-23 07:28:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:45,048 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:45,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318394861] [2020-12-23 07:28:45,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:45,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 07:28:45,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:28:45,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-23 07:28:45,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 07:28:45,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905901762] [2020-12-23 07:28:45,331 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:45,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318394861] [2020-12-23 07:28:45,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:45,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-12-23 07:28:45,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922970864] [2020-12-23 07:28:45,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 07:28:45,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 07:28:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-23 07:28:45,333 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 10 states. [2020-12-23 07:28:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:49,787 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2020-12-23 07:28:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 07:28:49,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-12-23 07:28:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:49,789 INFO L225 Difference]: With dead ends: 156 [2020-12-23 07:28:49,792 INFO L226 Difference]: Without dead ends: 105 [2020-12-23 07:28:49,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-12-23 07:28:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-23 07:28:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2020-12-23 07:28:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-23 07:28:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2020-12-23 07:28:49,827 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 48 [2020-12-23 07:28:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:49,828 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2020-12-23 07:28:49,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 07:28:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2020-12-23 07:28:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 07:28:49,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:49,829 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:50,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:50,048 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 4 times [2020-12-23 07:28:50,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:50,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048235041] [2020-12-23 07:28:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:50,061 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:50,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381114464] [2020-12-23 07:28:50,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:50,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 07:28:50,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:28:50,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 07:28:50,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:50,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048235041] [2020-12-23 07:28:50,277 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:50,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381114464] [2020-12-23 07:28:50,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:50,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 07:28:50,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034131789] [2020-12-23 07:28:50,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 07:28:50,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:50,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 07:28:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 07:28:50,280 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 7 states. [2020-12-23 07:28:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:50,445 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2020-12-23 07:28:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 07:28:50,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-12-23 07:28:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:50,447 INFO L225 Difference]: With dead ends: 189 [2020-12-23 07:28:50,448 INFO L226 Difference]: Without dead ends: 123 [2020-12-23 07:28:50,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 07:28:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-23 07:28:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2020-12-23 07:28:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-23 07:28:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2020-12-23 07:28:50,476 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 57 [2020-12-23 07:28:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:50,477 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2020-12-23 07:28:50,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 07:28:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2020-12-23 07:28:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 07:28:50,478 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 07:28:50,478 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 07:28:50,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:50,692 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 07:28:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 07:28:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 5 times [2020-12-23 07:28:50,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 07:28:50,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528688509] [2020-12-23 07:28:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 07:28:50,705 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 07:28:50,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093591870] [2020-12-23 07:28:50,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 07:28:50,781 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-12-23 07:28:50,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 07:28:50,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 07:28:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 07:28:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 07:28:51,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528688509] [2020-12-23 07:28:51,124 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 07:28:51,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093591870] [2020-12-23 07:28:51,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 07:28:51,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-12-23 07:28:51,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404299714] [2020-12-23 07:28:51,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 07:28:51,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 07:28:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 07:28:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-23 07:28:51,126 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 12 states. [2020-12-23 07:28:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 07:28:51,623 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-23 07:28:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 07:28:51,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-12-23 07:28:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 07:28:51,624 INFO L225 Difference]: With dead ends: 115 [2020-12-23 07:28:51,624 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 07:28:51,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-23 07:28:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 07:28:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 07:28:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 07:28:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 07:28:51,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2020-12-23 07:28:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 07:28:51,626 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 07:28:51,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 07:28:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 07:28:51,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 07:28:51,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 07:28:51,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 07:28:51,978 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2020-12-23 07:28:52,857 WARN L197 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-12-23 07:28:53,278 WARN L197 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-12-23 07:28:53,720 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-23 07:28:54,305 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2020-12-23 07:28:54,690 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-23 07:28:54,889 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2020-12-23 07:28:55,517 WARN L197 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-12-23 07:28:55,904 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-23 07:28:55,908 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-23 07:28:55,909 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-23 07:28:55,910 INFO L189 CegarLoopUtils]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-23 07:28:55,910 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,910 INFO L185 CegarLoopUtils]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse3 (* ULTIMATE.start_main_~y~0 4)) (.cse6 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 5)) (.cse8 (<= 0 ULTIMATE.start_main_~x~0))) (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (let ((.cse10 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse6 .cse7 .cse10 (= ULTIMATE.start_main_~a~0 2) .cse8 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2))) (and .cse6 (= ULTIMATE.start_main_~b~0 .cse3) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse10 .cse8 (= ULTIMATE.start_main_~a~0 4)) (and .cse6 (= ULTIMATE.start_main_~a~0 1) .cse7 .cse10 .cse8 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse2 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~r~0) .cse2 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse3)) .cse4 (= ULTIMATE.start_main_~q~0 4)) (let ((.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) (<= .cse5 ULTIMATE.start_main_~x~0) .cse0 (< (+ (* 2 ULTIMATE.start_main_~r~0) .cse5) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse1 .cse2 .cse4)) (and .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse2 .cse4 (= ULTIMATE.start_main_~b~0 0)) (let ((.cse9 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse0 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse9) .cse1 (< ULTIMATE.start_main_~x~0 (* 2 ULTIMATE.start_main_~b~0)) .cse2 .cse4 (<= .cse9 ULTIMATE.start_main_~x~0)))))) [2020-12-23 07:28:55,910 INFO L189 CegarLoopUtils]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2020-12-23 07:28:55,910 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,911 INFO L185 CegarLoopUtils]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse8 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse7)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse8 .cse1 .cse9 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse7) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-23 07:28:55,911 INFO L189 CegarLoopUtils]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2020-12-23 07:28:55,911 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,911 INFO L189 CegarLoopUtils]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,912 INFO L185 CegarLoopUtils]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse9 (* ULTIMATE.start_main_~y~0 4)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 5)) (.cse6 (<= 0 ULTIMATE.start_main_~x~0)) (.cse7 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse1 (* 2 ULTIMATE.start_main_~r~0)) (.cse0 (let ((.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse11 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse4 .cse5 .cse10 .cse11 (= ULTIMATE.start_main_~a~0 2) .cse6 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse7) (and .cse4 (= ULTIMATE.start_main_~b~0 .cse9) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse10 .cse11 .cse6 .cse7 (= ULTIMATE.start_main_~a~0 4)) (and .cse4 (= ULTIMATE.start_main_~a~0 1) .cse5 .cse10 .cse11 .cse6 .cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse3 (<= ULTIMATE.start_main_~x~0 5))) (or (let ((.cse2 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse0 (< .cse1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse2) .cse3 (<= .cse2 ULTIMATE.start_main_~x~0))) (and .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse7 .cse3) (let ((.cse8 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse8)) .cse0 (<= .cse8 ULTIMATE.start_main_~x~0) (< (+ .cse1 .cse8) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse3)) (and .cse0 (<= 0 ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse9)) .cse3 (= ULTIMATE.start_main_~q~0 4))))) [2020-12-23 07:28:55,912 INFO L189 CegarLoopUtils]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,912 INFO L185 CegarLoopUtils]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse5 (* ULTIMATE.start_main_~y~0 4)) (.cse7 (<= 1 ULTIMATE.start_main_~y~0)) (.cse8 (<= ULTIMATE.start_main_~y~0 5)) (.cse9 (<= 0 ULTIMATE.start_main_~x~0))) (let ((.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (* 2 ULTIMATE.start_main_~r~0)) (.cse2 (let ((.cse11 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse7 .cse8 .cse11 (= ULTIMATE.start_main_~a~0 2) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2))) (and .cse7 (= ULTIMATE.start_main_~b~0 .cse5) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse11 (= ULTIMATE.start_main_~a~0 4)) (and .cse7 .cse8 (= ULTIMATE.start_main_~a~0 1) .cse11 .cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (<= ULTIMATE.start_main_~x~0 5))) (or (and (or (let ((.cse1 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) (< .cse0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse1) .cse2 .cse3 .cse4 (<= .cse1 ULTIMATE.start_main_~x~0))) (and .cse2 (<= 0 ULTIMATE.start_main_~r~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) .cse4 (= ULTIMATE.start_main_~q~0 4))) .cse6) (and .cse7 .cse8 .cse6 .cse9 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse3 .cse4) (let ((.cse10 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse10)) (<= .cse10 ULTIMATE.start_main_~x~0) .cse6 (< (+ .cse0 .cse10) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse9 .cse2 .cse3 .cse4))))) [2020-12-23 07:28:55,912 INFO L189 CegarLoopUtils]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,913 INFO L185 CegarLoopUtils]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse7 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse8 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) .cse7 .cse1 (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse8)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse9 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse8) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-23 07:28:55,913 INFO L189 CegarLoopUtils]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,913 INFO L185 CegarLoopUtils]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse8 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse7)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse8 .cse1 .cse9 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse7) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-23 07:28:55,913 INFO L189 CegarLoopUtils]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,913 INFO L185 CegarLoopUtils]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_main_~a~0 1)) (.cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse8 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse4 .cse5) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse6 (<= ULTIMATE.start_main_~r~0 5) .cse1 (<= 0 ULTIMATE.start_main_~x~0) .cse4 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 4)) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse4 .cse5))) [2020-12-23 07:28:55,914 INFO L192 CegarLoopUtils]: At program point L65(lines 22 66) the Hoare annotation is: true [2020-12-23 07:28:55,914 INFO L189 CegarLoopUtils]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,914 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 07:28:55,914 INFO L185 CegarLoopUtils]: At program point L15-17(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~r~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 (= ULTIMATE.start_main_~a~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse6) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~a~0 2) .cse3 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse4 .cse5 .cse6))) [2020-12-23 07:28:55,914 INFO L189 CegarLoopUtils]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2020-12-23 07:28:55,914 INFO L192 CegarLoopUtils]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2020-12-23 07:28:55,914 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,914 INFO L189 CegarLoopUtils]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 07:28:55,915 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-23 07:28:55,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:28:55 BoogieIcfgContainer [2020-12-23 07:28:55,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 07:28:55,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 07:28:55,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 07:28:55,967 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 07:28:55,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:28:33" (3/4) ... [2020-12-23 07:28:55,981 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 07:28:56,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-12-23 07:28:56,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 07:28:56,007 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 07:28:56,007 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 07:28:56,107 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c-witness.graphml [2020-12-23 07:28:56,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 07:28:56,109 INFO L168 Benchmark]: Toolchain (without parser) took 23554.57 ms. Allocated memory was 151.0 MB in the beginning and 316.7 MB in the end (delta: 165.7 MB). Free memory was 126.2 MB in the beginning and 211.5 MB in the end (delta: -85.3 MB). Peak memory consumption was 81.4 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,109 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 07:28:56,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.27 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 116.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.40 ms. Allocated memory is still 151.0 MB. Free memory was 115.8 MB in the beginning and 114.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,110 INFO L168 Benchmark]: Boogie Preprocessor took 43.30 ms. Allocated memory is still 151.0 MB. Free memory was 114.1 MB in the beginning and 112.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,111 INFO L168 Benchmark]: RCFGBuilder took 651.57 ms. Allocated memory is still 151.0 MB. Free memory was 112.9 MB in the beginning and 130.1 MB in the end (delta: -17.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,113 INFO L168 Benchmark]: TraceAbstraction took 22327.65 ms. Allocated memory was 151.0 MB in the beginning and 316.7 MB in the end (delta: 165.7 MB). Free memory was 129.6 MB in the beginning and 215.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 188.6 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,113 INFO L168 Benchmark]: Witness Printer took 140.20 ms. Allocated memory is still 316.7 MB. Free memory was 215.7 MB in the beginning and 211.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 07:28:56,115 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.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 317.27 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 116.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.40 ms. Allocated memory is still 151.0 MB. Free memory was 115.8 MB in the beginning and 114.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.30 ms. Allocated memory is still 151.0 MB. Free memory was 114.1 MB in the beginning and 112.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 651.57 ms. Allocated memory is still 151.0 MB. Free memory was 112.9 MB in the beginning and 130.1 MB in the end (delta: -17.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22327.65 ms. Allocated memory was 151.0 MB in the beginning and 316.7 MB in the end (delta: 165.7 MB). Free memory was 129.6 MB in the beginning and 215.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 188.6 MB. Max. memory is 8.0 GB. * Witness Printer took 140.20 ms. Allocated memory is still 316.7 MB. Free memory was 215.7 MB in the beginning and 211.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((a == q && 2 * r < x) && x == r + b) && b <= 2 * y) && ((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5) && 2 * y <= x) || (((((((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y)) && 0 <= r) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && 1 == cond) || (((((((1 <= y && y <= 5) && 1 == cond) && 0 <= x) && r == x) && q == 0) && cond == 1) && x <= 5)) || (((((((x == r + q * y && q * y <= x) && 1 == cond) && 2 * r + q * y < y + x) && 0 <= x) && ((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((r < 2 * b && x == r + q * y) && a == 1) && r <= 5) && 1 == cond) && 0 <= x) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && a == 1) && 1 == cond) && 2 * r < x) && cond == 1) && x <= 5) || ((((((1 <= y && a == 1) && 1 == cond) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((a == q && (((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y))) && 2 * r < x) && x == r + b) && b <= 2 * y) && x <= 5) && 2 * y <= x) || ((((((1 <= y && y <= 5) && 0 <= x) && r == x) && q == 0) && cond == 1) && x <= 5)) || ((((x == r + q * y && (((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y))) && q * y <= x) && 2 * r + q * y < y + x) && x <= 5)) || (((((((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y)) && 0 <= r) && x == r + y * 4) && x <= 5) && q == 4) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && 2 * r < x) && cond == 1) && x <= 5) || ((((1 <= y && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && a == 1) && 1 == cond) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((1 <= y && a == 1) && 2 * b <= r) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && x <= 5) || ((((((((1 <= y && 2 * b <= r) && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && 2 * r < x) && cond == 1) && x <= 5) || ((((1 <= y && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && a == 1) && 1 == cond) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((1 == cond && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && 0 <= r) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4) || ((((((x == r + q * y && q * y <= x) && 1 == cond) && 2 * r + q * y < y + x) && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5)) || ((((((((1 <= y && y <= 5) && 0 <= x) && a == 0) && r == x) && q == 0) && cond == 1) && x <= 5) && b == 0)) || ((((((((a == q && 1 == cond) && x == r + b) && b <= 2 * y) && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && x < 2 * b) && cond == 1) && x <= 5) && 2 * y <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.1s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 336 SDtfs, 1918 SDslu, 841 SDs, 0 SdLazy, 1871 SolverSat, 474 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 229 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 50 NumberOfFragments, 1601 HoareAnnotationTreeSize, 10 FomulaSimplifications, 23392 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 2959 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 386 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 159535 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1349 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 140/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...