/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-05 23:53:58,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-05 23:53:58,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-05 23:53:58,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-05 23:53:58,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-05 23:53:58,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-05 23:53:58,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-05 23:53:58,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-05 23:53:58,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-05 23:53:58,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-05 23:53:58,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-05 23:53:58,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-05 23:53:58,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-05 23:53:58,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-05 23:53:58,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-05 23:53:58,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-05 23:53:58,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-05 23:53:58,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-05 23:53:58,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-05 23:53:58,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-05 23:53:58,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-05 23:53:58,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-05 23:53:58,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-05 23:53:58,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-05 23:53:58,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-05 23:53:58,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-05 23:53:58,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-05 23:53:58,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-05 23:53:58,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-05 23:53:58,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-05 23:53:58,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-05 23:53:58,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-05 23:53:58,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-05 23:53:58,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-05 23:53:58,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-05 23:53:58,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-05 23:53:58,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-05 23:53:58,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-05 23:53:58,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-05 23:53:58,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-05 23:53:58,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-05 23:53:58,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-05 23:53:58,746 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-05 23:53:58,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-05 23:53:58,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-05 23:53:58,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-05 23:53:58,749 INFO L138 SettingsManager]: * Use SBE=true [2021-05-05 23:53:58,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-05 23:53:58,749 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-05 23:53:58,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-05 23:53:58,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-05 23:53:58,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-05 23:53:58,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-05 23:53:58,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:53:58,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-05 23:53:58,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-05 23:53:58,752 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-05 23:53:59,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-05 23:53:59,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-05 23:53:59,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-05 23:53:59,060 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-05 23:53:59,061 INFO L275 PluginConnector]: CDTParser initialized [2021-05-05 23:53:59,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-05-05 23:53:59,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb2e93cb/65379be4996140a08a70513cb8cda157/FLAG548427fa7 [2021-05-05 23:53:59,509 INFO L306 CDTParser]: Found 1 translation units. [2021-05-05 23:53:59,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-05-05 23:53:59,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb2e93cb/65379be4996140a08a70513cb8cda157/FLAG548427fa7 [2021-05-05 23:53:59,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb2e93cb/65379be4996140a08a70513cb8cda157 [2021-05-05 23:53:59,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-05 23:53:59,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-05 23:53:59,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-05 23:53:59,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-05 23:53:59,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-05 23:53:59,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627fc75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59, skipping insertion in model container [2021-05-05 23:53:59,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-05 23:53:59,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-05 23:53:59,672 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-05-05 23:53:59,684 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-05-05 23:53:59,689 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-05-05 23:53:59,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:53:59,701 INFO L203 MainTranslator]: Completed pre-run [2021-05-05 23:53:59,752 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-05-05 23:53:59,761 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-05-05 23:53:59,766 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-05-05 23:53:59,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:53:59,779 INFO L208 MainTranslator]: Completed translation [2021-05-05 23:53:59,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59 WrapperNode [2021-05-05 23:53:59,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-05 23:53:59,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-05 23:53:59,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-05 23:53:59,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-05 23:53:59,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... [2021-05-05 23:53:59,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-05 23:53:59,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-05 23:53:59,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-05 23:53:59,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-05 23:53:59,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:53:59,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-05 23:53:59,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-05 23:53:59,870 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-05 23:53:59,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-05 23:53:59,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-05 23:53:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-05 23:53:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-05 23:53:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-05 23:53:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-05 23:53:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-05 23:53:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-05 23:53:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-05 23:53:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-05 23:54:00,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-05 23:54:00,092 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-05 23:54:00,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:00 BoogieIcfgContainer [2021-05-05 23:54:00,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-05 23:54:00,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-05 23:54:00,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-05 23:54:00,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-05 23:54:00,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:53:59" (1/3) ... [2021-05-05 23:54:00,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7ff230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:00, skipping insertion in model container [2021-05-05 23:54:00,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:53:59" (2/3) ... [2021-05-05 23:54:00,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7ff230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:00, skipping insertion in model container [2021-05-05 23:54:00,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:00" (3/3) ... [2021-05-05 23:54:00,098 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2021-05-05 23:54:00,101 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-05 23:54:00,103 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-05-05 23:54:00,113 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-05 23:54:00,126 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-05 23:54:00,126 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-05 23:54:00,126 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-05 23:54:00,126 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-05 23:54:00,126 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-05 23:54:00,126 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-05 23:54:00,126 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-05 23:54:00,126 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-05 23:54:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-05 23:54:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-05 23:54:00,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:00,138 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:00,139 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 613221753, now seen corresponding path program 1 times [2021-05-05 23:54:00,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:00,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617887135] [2021-05-05 23:54:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:00,400 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:00,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617887135] [2021-05-05 23:54:00,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617887135] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:00,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:00,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:00,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224868370] [2021-05-05 23:54:00,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:00,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:00,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:00,417 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:00,527 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-05-05 23:54:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-05 23:54:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-05 23:54:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:00,533 INFO L225 Difference]: With dead ends: 51 [2021-05-05 23:54:00,533 INFO L226 Difference]: Without dead ends: 33 [2021-05-05 23:54:00,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-05 23:54:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2021-05-05 23:54:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-05-05 23:54:00,562 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2021-05-05 23:54:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:00,562 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-05-05 23:54:00,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-05-05 23:54:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:00,563 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:00,563 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:00,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-05 23:54:00,563 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash -274269075, now seen corresponding path program 1 times [2021-05-05 23:54:00,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:00,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895051050] [2021-05-05 23:54:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:00,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:00,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895051050] [2021-05-05 23:54:00,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895051050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:00,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:00,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:00,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161596646] [2021-05-05 23:54:00,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:00,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:00,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:00,688 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:00,785 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-05-05 23:54:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:00,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:00,786 INFO L225 Difference]: With dead ends: 51 [2021-05-05 23:54:00,786 INFO L226 Difference]: Without dead ends: 49 [2021-05-05 23:54:00,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-05 23:54:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2021-05-05 23:54:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-05-05 23:54:00,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2021-05-05 23:54:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:00,792 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-05-05 23:54:00,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-05-05 23:54:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:00,792 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:00,792 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:00,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-05 23:54:00,792 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash -210546126, now seen corresponding path program 1 times [2021-05-05 23:54:00,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:00,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12878909] [2021-05-05 23:54:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:00,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:00,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12878909] [2021-05-05 23:54:00,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12878909] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:00,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:00,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:00,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843480871] [2021-05-05 23:54:00,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:00,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:00,883 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:00,950 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2021-05-05 23:54:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-05 23:54:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:00,953 INFO L225 Difference]: With dead ends: 60 [2021-05-05 23:54:00,953 INFO L226 Difference]: Without dead ends: 40 [2021-05-05 23:54:00,953 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-05 23:54:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2021-05-05 23:54:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-05-05 23:54:00,966 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2021-05-05 23:54:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:00,966 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-05-05 23:54:00,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-05-05 23:54:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-05 23:54:00,967 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:00,968 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:00,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-05 23:54:00,968 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 144789104, now seen corresponding path program 1 times [2021-05-05 23:54:00,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:00,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494312179] [2021-05-05 23:54:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:01,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:01,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494312179] [2021-05-05 23:54:01,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494312179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:01,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:01,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:01,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288396808] [2021-05-05 23:54:01,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:01,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:01,022 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:01,087 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2021-05-05 23:54:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-05 23:54:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-05 23:54:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:01,088 INFO L225 Difference]: With dead ends: 54 [2021-05-05 23:54:01,088 INFO L226 Difference]: Without dead ends: 34 [2021-05-05 23:54:01,088 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-05 23:54:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2021-05-05 23:54:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-05-05 23:54:01,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2021-05-05 23:54:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:01,092 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-05-05 23:54:01,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2021-05-05 23:54:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-05 23:54:01,092 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:01,092 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:01,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-05 23:54:01,093 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1825758388, now seen corresponding path program 1 times [2021-05-05 23:54:01,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:01,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302659259] [2021-05-05 23:54:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:01,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:01,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302659259] [2021-05-05 23:54:01,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302659259] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:01,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:01,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-05 23:54:01,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388448729] [2021-05-05 23:54:01,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-05 23:54:01,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:01,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-05 23:54:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:01,485 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:01,605 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2021-05-05 23:54:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-05 23:54:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-05 23:54:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:01,609 INFO L225 Difference]: With dead ends: 44 [2021-05-05 23:54:01,609 INFO L226 Difference]: Without dead ends: 29 [2021-05-05 23:54:01,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 184.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-05 23:54:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-05 23:54:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-05 23:54:01,619 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2021-05-05 23:54:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:01,619 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-05 23:54:01,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-05 23:54:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-05 23:54:01,621 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:01,621 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:01,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-05 23:54:01,621 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1415757154, now seen corresponding path program 1 times [2021-05-05 23:54:01,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:01,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077354689] [2021-05-05 23:54:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:01,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:01,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077354689] [2021-05-05 23:54:01,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077354689] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:01,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:01,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:01,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043061512] [2021-05-05 23:54:01,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:01,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:01,710 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:01,788 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-05-05 23:54:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-05 23:54:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:01,789 INFO L225 Difference]: With dead ends: 42 [2021-05-05 23:54:01,789 INFO L226 Difference]: Without dead ends: 40 [2021-05-05 23:54:01,789 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-05 23:54:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2021-05-05 23:54:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-05 23:54:01,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2021-05-05 23:54:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:01,792 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-05 23:54:01,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-05 23:54:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-05 23:54:01,792 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:01,792 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:01,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-05 23:54:01,793 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:01,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2087901094, now seen corresponding path program 1 times [2021-05-05 23:54:01,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:01,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536100651] [2021-05-05 23:54:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:01,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:01,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536100651] [2021-05-05 23:54:01,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536100651] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:01,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707953820] [2021-05-05 23:54:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-05 23:54:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:01,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-05 23:54:01,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-05 23:54:02,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:02,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707953820] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:02,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-05 23:54:02,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2021-05-05 23:54:02,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006837423] [2021-05-05 23:54:02,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-05 23:54:02,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-05 23:54:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:02,117 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:02,971 WARN L205 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-05-05 23:54:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:03,020 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-05-05 23:54:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-05 23:54:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:03,020 INFO L225 Difference]: With dead ends: 30 [2021-05-05 23:54:03,020 INFO L226 Difference]: Without dead ends: 0 [2021-05-05 23:54:03,021 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 868.2ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-05 23:54:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-05 23:54:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-05 23:54:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-05 23:54:03,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-05-05 23:54:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:03,021 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-05 23:54:03,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-05 23:54:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-05 23:54:03,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-05 23:54:03,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-05 23:54:04,101 WARN L205 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-05-05 23:54:04,173 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-05 23:54:04,173 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-05 23:54:04,173 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~__return_136~0 |old(~__return_136~0)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-05 23:54:04,174 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L31(lines 31 147) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L60(lines 60 93) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 14 168) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L194 CegarLoopUtils]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L73(line 73) no Hoare annotation was computed. [2021-05-05 23:54:04,174 INFO L198 CegarLoopUtils]: For program point L40(lines 40 139) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L201 CegarLoopUtils]: At program point L131(lines 98 132) the Hoare annotation is: true [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L194 CegarLoopUtils]: At program point L156(lines 26 157) the Hoare annotation is: (or (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) (= main_~main__loop_entered~0 0)) [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L57(lines 57 133) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L24(lines 24 162) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L194 CegarLoopUtils]: At program point L119(lines 99 128) the Hoare annotation is: (let ((.cse8 (div main_~main__index1~0 4294967296)) (.cse7 (div main_~main__index2~0 4294967296))) (let ((.cse9 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (* 4294967296 .cse7)) (.cse1 (+ main_~main__index2~0 (* 4294967296 .cse8)))) (or (and (or (<= (+ main_~main__index1~0 .cse0) .cse1) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse8 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse7 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1))))))) .cse9 (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (not (= main_~__VERIFIER_assert__cond~2 0)) .cse9 (<= (+ main_~main__index1~0 .cse0 1) .cse1))))) [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L62(lines 62 88) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L29(lines 29 152) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L194 CegarLoopUtils]: At program point L87(lines 62 88) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L21(lines 21 167) no Hoare annotation was computed. [2021-05-05 23:54:04,175 INFO L198 CegarLoopUtils]: For program point L50(lines 50 138) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L194 CegarLoopUtils]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (<= main_~main__index2~0 (+ .cse2 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (not (= main_~main____CPAchecker_TMP_0~1 0)) .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (and .cse0 .cse1 (= main_~main____CPAchecker_TMP_0~0 1)))) (<= (+ main_~main__index1~0 .cse2 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 14 168) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point L108(lines 108 120) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point L42(line 42) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point L71(lines 71 80) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 14 168) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#valid)| |#valid|)) [2021-05-05 23:54:04,176 INFO L194 CegarLoopUtils]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-05-05 23:54:04,176 INFO L198 CegarLoopUtils]: For program point L26(lines 26 157) no Hoare annotation was computed. [2021-05-05 23:54:04,176 INFO L194 CegarLoopUtils]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-05 23:54:04,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:54:04 BoogieIcfgContainer [2021-05-05 23:54:04,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-05 23:54:04,214 INFO L168 Benchmark]: Toolchain (without parser) took 4681.96 ms. Allocated memory is still 222.3 MB. Free memory was 185.9 MB in the beginning and 94.0 MB in the end (delta: 91.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:04,215 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 222.3 MB. Free memory was 203.2 MB in the beginning and 203.1 MB in the end (delta: 101.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-05 23:54:04,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.69 ms. Allocated memory is still 222.3 MB. Free memory was 185.7 MB in the beginning and 204.0 MB in the end (delta: -18.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:04,215 INFO L168 Benchmark]: Boogie Preprocessor took 33.94 ms. Allocated memory is still 222.3 MB. Free memory was 204.0 MB in the beginning and 201.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:04,215 INFO L168 Benchmark]: RCFGBuilder took 274.32 ms. Allocated memory is still 222.3 MB. Free memory was 201.9 MB in the beginning and 182.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:04,215 INFO L168 Benchmark]: TraceAbstraction took 4119.54 ms. Allocated memory is still 222.3 MB. Free memory was 182.0 MB in the beginning and 94.0 MB in the end (delta: 88.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:04,222 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.14 ms. Allocated memory is still 222.3 MB. Free memory was 203.2 MB in the beginning and 203.1 MB in the end (delta: 101.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 244.69 ms. Allocated memory is still 222.3 MB. Free memory was 185.7 MB in the beginning and 204.0 MB in the end (delta: -18.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.94 ms. Allocated memory is still 222.3 MB. Free memory was 204.0 MB in the beginning and 201.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 274.32 ms. Allocated memory is still 222.3 MB. Free memory was 201.9 MB in the beginning and 182.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4119.54 ms. Allocated memory is still 222.3 MB. Free memory was 182.0 MB in the beginning and 94.0 MB in the end (delta: 88.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 110]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3098.2ms, OverallIterations: 7, TraceHistogramMax: 2, EmptinessCheckTime: 7.6ms, AutomataDifference: 1475.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 950.3ms, InitialAbstractionConstructionTime: 7.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 188 SDtfs, 170 SDslu, 250 SDs, 0 SdLazy, 380 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 383.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1266.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 51.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 579 HoareAnnotationTreeSize, 12 FomulaSimplifications, 514 FormulaSimplificationTreeSizeReduction, 35.9ms HoareSimplificationTime, 12 FomulaSimplificationsInter, 161 FormulaSimplificationTreeSizeReductionInter, 906.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 29.4ms SsaConstructionTime, 178.9ms SatisfiabilityAnalysisTime, 983.2ms InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1604 SizeOfPredicates, 2 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 1)) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) || main__loop_entered == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 1)) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((!(main____CPAchecker_TMP_0 == 0) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main__loop_entered == 0) && main____CPAchecker_TMP_0 == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((!(main____CPAchecker_TMP_0 == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && main____CPAchecker_TMP_0 == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) RESULT: Ultimate proved your program to be correct! Received shutdown request...