/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:29:56,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:29:56,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:29:56,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:29:56,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:29:56,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:29:56,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:29:56,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:29:56,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:29:56,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:29:56,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:29:56,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:29:56,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:29:56,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:29:56,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:29:56,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:29:56,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:29:56,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:29:56,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:29:56,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:29:56,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:29:56,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:29:56,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:29:56,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:29:56,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:29:56,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:29:56,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:29:56,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:29:56,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:29:56,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:29:56,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:29:56,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:29:56,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:29:56,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:29:56,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:29:56,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:29:56,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:29:56,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:29:56,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:29:56,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:29:56,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:29:56,747 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 15:29:56,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:29:56,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:29:56,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:29:56,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:29:56,777 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:29:56,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:29:56,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:29:56,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:29:56,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:29:56,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:29:56,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:29:56,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:29:56,779 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:29:56,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:29:56,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:29:56,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:29:56,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:29:56,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:29:56,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:29:56,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:29:56,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:29:56,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:29:56,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:29:56,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:29:56,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:29:56,781 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 15:29:57,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:29:57,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:29:57,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:29:57,249 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:29:57,250 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:29:57,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2020-12-23 15:29:57,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb0f45fef/2f6dbd7f10ec45d5ae2bbcf1c626b887/FLAG563bcb53b [2020-12-23 15:29:58,353 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:29:58,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2020-12-23 15:29:58,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb0f45fef/2f6dbd7f10ec45d5ae2bbcf1c626b887/FLAG563bcb53b [2020-12-23 15:29:58,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb0f45fef/2f6dbd7f10ec45d5ae2bbcf1c626b887 [2020-12-23 15:29:58,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:29:58,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:29:58,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:29:58,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:29:58,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:29:58,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:29:58" (1/1) ... [2020-12-23 15:29:58,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414cf7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:29:58, skipping insertion in model container [2020-12-23 15:29:58,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:29:58" (1/1) ... [2020-12-23 15:29:58,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:29:58,953 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~first~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~first~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v,],base],StructAccessExpression[IdentifierExpression[~v,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_once~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__warned~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[324],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[320],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data_size~0,] left hand side expression in assignment: lhs: VariableLHS[~rdac_pg~0,] left hand side expression in assignment: lhs: VariableLHS[~common~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~lun_table~0,] left hand side expression in assignment: lhs: VariableLHS[~data_size~0,] left hand side expression in assignment: lhs: VariableLHS[~rdac_pg___0~0,] left hand side expression in assignment: lhs: VariableLHS[~common~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~lun_table~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~qdata~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lun_table~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~lun_table~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~qdata~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~1,] left hand side expression in assignment: address: IdentifierExpression[#t~mem143,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem144,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem144,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem145,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem145,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem146,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem147,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem147,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[274],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[348],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],counter] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[460],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[484],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~q~1,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~2,] left hand side expression in assignment: address: IdentifierExpression[#t~mem168,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[274],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~inqp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~array_name,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~array_name,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~array_name,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~array_name,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~inqp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[34],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[34],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~inqp~2,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~inqp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem202,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem202,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~h~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~2,] left hand side expression in assignment: lhs: VariableLHS[~sdev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~h~1,] left hand side expression in assignment: lhs: VariableLHS[~q~2,] left hand side expression in assignment: lhs: VariableLHS[~retry_cnt~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],next] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],prev] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~rq~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retry_cnt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~qdata~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem234,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[#t~mem234,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~qdata~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~qdata~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ctlr~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~h~2,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~h~3,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~req,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~h~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~h~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~h~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~h~6,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~__lock_name~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~kmpath_rdacd~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~rdac_dh_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~6,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:30:00,308 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2020-12-23 15:30:00,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:30:00,368 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~first~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~first~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v,],base],StructAccessExpression[IdentifierExpression[~v,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_once~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__warned~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[324],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[320],StructAccessExpression[IdentifierExpression[~rq~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data_size~0,] left hand side expression in assignment: lhs: VariableLHS[~rdac_pg~0,] left hand side expression in assignment: lhs: VariableLHS[~common~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~rdac_pg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~lun_table~0,] left hand side expression in assignment: lhs: VariableLHS[~data_size~0,] left hand side expression in assignment: lhs: VariableLHS[~rdac_pg___0~0,] left hand side expression in assignment: lhs: VariableLHS[~common~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~rdac_pg___0~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~lun_table~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~common~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~common~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~qdata~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lun_table~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~lun_table~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[#t~mem137,],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~qdata~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~1,] left hand side expression in assignment: address: IdentifierExpression[#t~mem143,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem144,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem144,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem145,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem145,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem146,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem147,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem147,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[274],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~rq~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[348],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[460],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[484],StructAccessExpression[IdentifierExpression[~ctlr~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~q~1,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~rq~2,] left hand side expression in assignment: address: IdentifierExpression[#t~mem171,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem174,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem174,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[274],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~rq~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~rq~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~inqp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~array_name,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~array_name,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~array_name,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~array_name,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~inqp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[34],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[34],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~inqp~2,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~h,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~inqp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem205,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem205,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem206,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem206,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~h~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~ctlr~2,] left hand side expression in assignment: lhs: VariableLHS[~sdev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~h~1,] left hand side expression in assignment: lhs: VariableLHS[~q~2,] left hand side expression in assignment: lhs: VariableLHS[~retry_cnt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~rq~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~err~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retry_cnt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~qdata~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem249,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[#t~mem249,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~qdata~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~qdata~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~qdata~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~qdata~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ctlr~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[456],StructAccessExpression[IdentifierExpression[~ctlr~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ctlr~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~ctlr~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~h~2,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~act~0,] left hand side expression in assignment: lhs: VariableLHS[~err~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~h~3,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~req,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~h~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~h~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~h~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~h~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],StructAccessExpression[IdentifierExpression[~h~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~err~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~h~6,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~__lock_name~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~kmpath_rdacd~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~rdac_dh_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_struct_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_work_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~6,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] [2020-12-23 15:30:00,720 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2020-12-23 15:30:00,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:30:01,023 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:30:01,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01 WrapperNode [2020-12-23 15:30:01,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:30:01,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:30:01,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:30:01,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:30:01,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:01,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:01,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:30:01,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:30:01,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:30:01,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:30:01,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:01,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:02,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:02,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:02,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:02,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:02,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (1/1) ... [2020-12-23 15:30:03,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:30:03,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:30:03,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:30:03,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:30:03,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (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 15:30:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 15:30:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2020-12-23 15:30:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2020-12-23 15:30:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-12-23 15:30:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 15:30:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 15:30:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:30:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:30:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2020-12-23 15:30:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2020-12-23 15:30:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:30:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_bus_detach [2020-12-23 15:30:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_bus_detach [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 15:30:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:30:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2020-12-23 15:30:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:30:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:30:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:30:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 15:30:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:30:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:30:23,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:30:23,241 INFO L299 CfgBuilder]: Removed 3524 assume(true) statements. [2020-12-23 15:30:23,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:30:23 BoogieIcfgContainer [2020-12-23 15:30:23,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:30:23,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:30:23,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:30:23,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:30:23,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:29:58" (1/3) ... [2020-12-23 15:30:23,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21045d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:30:23, skipping insertion in model container [2020-12-23 15:30:23,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:30:01" (2/3) ... [2020-12-23 15:30:23,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21045d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:30:23, skipping insertion in model container [2020-12-23 15:30:23,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:30:23" (3/3) ... [2020-12-23 15:30:23,257 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2020-12-23 15:30:23,264 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:30:23,272 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-12-23 15:30:23,290 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-23 15:30:23,345 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:30:23,346 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:30:23,346 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:30:23,346 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:30:23,346 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:30:23,346 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:30:23,347 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:30:23,347 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:30:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states. [2020-12-23 15:30:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 15:30:23,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:23,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:23,441 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:23,455 INFO L82 PathProgramCache]: Analyzing trace with hash -792164640, now seen corresponding path program 1 times [2020-12-23 15:30:23,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:23,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979896596] [2020-12-23 15:30:23,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:24,308 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 15:30:24,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979896596] [2020-12-23 15:30:24,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:24,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:30:24,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450963692] [2020-12-23 15:30:24,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:30:24,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:30:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:30:24,339 INFO L87 Difference]: Start difference. First operand 3676 states. Second operand 2 states. [2020-12-23 15:30:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:24,620 INFO L93 Difference]: Finished difference Result 7348 states and 10581 transitions. [2020-12-23 15:30:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:30:24,621 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2020-12-23 15:30:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:24,668 INFO L225 Difference]: With dead ends: 7348 [2020-12-23 15:30:24,668 INFO L226 Difference]: Without dead ends: 2283 [2020-12-23 15:30:24,695 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 15:30:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2020-12-23 15:30:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2283. [2020-12-23 15:30:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2283 states. [2020-12-23 15:30:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3215 transitions. [2020-12-23 15:30:24,890 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3215 transitions. Word has length 30 [2020-12-23 15:30:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:24,891 INFO L481 AbstractCegarLoop]: Abstraction has 2283 states and 3215 transitions. [2020-12-23 15:30:24,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:30:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3215 transitions. [2020-12-23 15:30:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 15:30:24,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:24,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:24,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:30:24,896 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -557880348, now seen corresponding path program 1 times [2020-12-23 15:30:24,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:24,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444662253] [2020-12-23 15:30:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:25,198 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 15:30:25,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444662253] [2020-12-23 15:30:25,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:25,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:25,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366901787] [2020-12-23 15:30:25,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:25,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:25,204 INFO L87 Difference]: Start difference. First operand 2283 states and 3215 transitions. Second operand 3 states. [2020-12-23 15:30:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:25,513 INFO L93 Difference]: Finished difference Result 4923 states and 6947 transitions. [2020-12-23 15:30:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:25,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-23 15:30:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:25,535 INFO L225 Difference]: With dead ends: 4923 [2020-12-23 15:30:25,535 INFO L226 Difference]: Without dead ends: 2659 [2020-12-23 15:30:25,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2020-12-23 15:30:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2658. [2020-12-23 15:30:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2020-12-23 15:30:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3750 transitions. [2020-12-23 15:30:25,651 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3750 transitions. Word has length 30 [2020-12-23 15:30:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:25,652 INFO L481 AbstractCegarLoop]: Abstraction has 2658 states and 3750 transitions. [2020-12-23 15:30:25,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3750 transitions. [2020-12-23 15:30:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 15:30:25,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:25,663 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:25,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:30:25,665 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 889001481, now seen corresponding path program 1 times [2020-12-23 15:30:25,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:25,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796533311] [2020-12-23 15:30:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:30:26,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796533311] [2020-12-23 15:30:26,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:26,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:30:26,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469712925] [2020-12-23 15:30:26,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:26,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:26,117 INFO L87 Difference]: Start difference. First operand 2658 states and 3750 transitions. Second operand 3 states. [2020-12-23 15:30:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:26,475 INFO L93 Difference]: Finished difference Result 2711 states and 3826 transitions. [2020-12-23 15:30:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:26,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 15:30:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:26,493 INFO L225 Difference]: With dead ends: 2711 [2020-12-23 15:30:26,493 INFO L226 Difference]: Without dead ends: 2707 [2020-12-23 15:30:26,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2020-12-23 15:30:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2654. [2020-12-23 15:30:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2020-12-23 15:30:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3746 transitions. [2020-12-23 15:30:26,590 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3746 transitions. Word has length 50 [2020-12-23 15:30:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:26,590 INFO L481 AbstractCegarLoop]: Abstraction has 2654 states and 3746 transitions. [2020-12-23 15:30:26,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3746 transitions. [2020-12-23 15:30:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 15:30:26,598 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:26,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:26,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:30:26,599 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1521652847, now seen corresponding path program 1 times [2020-12-23 15:30:26,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:26,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785622838] [2020-12-23 15:30:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:30:26,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785622838] [2020-12-23 15:30:26,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:26,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 15:30:26,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511362232] [2020-12-23 15:30:26,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:30:26,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:30:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:30:26,928 INFO L87 Difference]: Start difference. First operand 2654 states and 3746 transitions. Second operand 7 states. [2020-12-23 15:30:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:28,533 INFO L93 Difference]: Finished difference Result 15298 states and 21830 transitions. [2020-12-23 15:30:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 15:30:28,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-12-23 15:30:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:28,627 INFO L225 Difference]: With dead ends: 15298 [2020-12-23 15:30:28,627 INFO L226 Difference]: Without dead ends: 12663 [2020-12-23 15:30:28,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-12-23 15:30:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12663 states. [2020-12-23 15:30:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12663 to 2661. [2020-12-23 15:30:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2020-12-23 15:30:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3753 transitions. [2020-12-23 15:30:28,883 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3753 transitions. Word has length 86 [2020-12-23 15:30:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:28,884 INFO L481 AbstractCegarLoop]: Abstraction has 2661 states and 3753 transitions. [2020-12-23 15:30:28,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:30:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3753 transitions. [2020-12-23 15:30:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 15:30:28,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:28,895 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:28,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:30:28,896 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 460602907, now seen corresponding path program 1 times [2020-12-23 15:30:28,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:28,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252180974] [2020-12-23 15:30:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:30:29,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252180974] [2020-12-23 15:30:29,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:29,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:29,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464834980] [2020-12-23 15:30:29,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:29,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:29,302 INFO L87 Difference]: Start difference. First operand 2661 states and 3753 transitions. Second operand 3 states. [2020-12-23 15:30:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:29,461 INFO L93 Difference]: Finished difference Result 5304 states and 7488 transitions. [2020-12-23 15:30:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:29,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 15:30:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:29,480 INFO L225 Difference]: With dead ends: 5304 [2020-12-23 15:30:29,480 INFO L226 Difference]: Without dead ends: 2662 [2020-12-23 15:30:29,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2020-12-23 15:30:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2020-12-23 15:30:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2020-12-23 15:30:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3754 transitions. [2020-12-23 15:30:29,627 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3754 transitions. Word has length 104 [2020-12-23 15:30:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:29,628 INFO L481 AbstractCegarLoop]: Abstraction has 2662 states and 3754 transitions. [2020-12-23 15:30:29,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3754 transitions. [2020-12-23 15:30:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 15:30:29,638 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:29,638 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:29,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:30:29,639 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1846806301, now seen corresponding path program 1 times [2020-12-23 15:30:29,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:29,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050570159] [2020-12-23 15:30:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:30:29,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050570159] [2020-12-23 15:30:29,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:29,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:29,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330644378] [2020-12-23 15:30:29,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:29,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:29,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:29,890 INFO L87 Difference]: Start difference. First operand 2662 states and 3754 transitions. Second operand 3 states. [2020-12-23 15:30:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:30,052 INFO L93 Difference]: Finished difference Result 5307 states and 7491 transitions. [2020-12-23 15:30:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:30,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 15:30:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:30,070 INFO L225 Difference]: With dead ends: 5307 [2020-12-23 15:30:30,070 INFO L226 Difference]: Without dead ends: 2664 [2020-12-23 15:30:30,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2020-12-23 15:30:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2020-12-23 15:30:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2020-12-23 15:30:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3755 transitions. [2020-12-23 15:30:30,206 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3755 transitions. Word has length 104 [2020-12-23 15:30:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:30,206 INFO L481 AbstractCegarLoop]: Abstraction has 2663 states and 3755 transitions. [2020-12-23 15:30:30,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3755 transitions. [2020-12-23 15:30:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:30:30,215 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:30,216 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:30,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 15:30:30,216 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash -915727423, now seen corresponding path program 1 times [2020-12-23 15:30:30,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:30,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583683845] [2020-12-23 15:30:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:30:30,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583683845] [2020-12-23 15:30:30,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:30,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:30:30,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864483579] [2020-12-23 15:30:30,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:30,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:30,472 INFO L87 Difference]: Start difference. First operand 2663 states and 3755 transitions. Second operand 5 states. [2020-12-23 15:30:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:31,141 INFO L93 Difference]: Finished difference Result 8231 states and 11659 transitions. [2020-12-23 15:30:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:30:31,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2020-12-23 15:30:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:31,175 INFO L225 Difference]: With dead ends: 8231 [2020-12-23 15:30:31,175 INFO L226 Difference]: Without dead ends: 5587 [2020-12-23 15:30:31,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 15:30:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2020-12-23 15:30:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 2667. [2020-12-23 15:30:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2020-12-23 15:30:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3759 transitions. [2020-12-23 15:30:31,361 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3759 transitions. Word has length 106 [2020-12-23 15:30:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:31,362 INFO L481 AbstractCegarLoop]: Abstraction has 2667 states and 3759 transitions. [2020-12-23 15:30:31,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3759 transitions. [2020-12-23 15:30:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 15:30:31,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:31,373 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:31,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 15:30:31,373 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash 451314063, now seen corresponding path program 1 times [2020-12-23 15:30:31,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:31,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773570303] [2020-12-23 15:30:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:30:31,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773570303] [2020-12-23 15:30:31,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:31,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:30:31,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435905904] [2020-12-23 15:30:31,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:30:31,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:31,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:30:31,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:30:31,652 INFO L87 Difference]: Start difference. First operand 2667 states and 3759 transitions. Second operand 4 states. [2020-12-23 15:30:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:31,862 INFO L93 Difference]: Finished difference Result 5325 states and 7513 transitions. [2020-12-23 15:30:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:30:31,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 15:30:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:31,878 INFO L225 Difference]: With dead ends: 5325 [2020-12-23 15:30:31,879 INFO L226 Difference]: Without dead ends: 2677 [2020-12-23 15:30:31,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2020-12-23 15:30:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2669. [2020-12-23 15:30:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2020-12-23 15:30:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3761 transitions. [2020-12-23 15:30:32,037 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3761 transitions. Word has length 111 [2020-12-23 15:30:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:32,037 INFO L481 AbstractCegarLoop]: Abstraction has 2669 states and 3761 transitions. [2020-12-23 15:30:32,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:30:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3761 transitions. [2020-12-23 15:30:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 15:30:32,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:32,047 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:32,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 15:30:32,048 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1480673361, now seen corresponding path program 1 times [2020-12-23 15:30:32,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:32,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888699628] [2020-12-23 15:30:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:30:32,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888699628] [2020-12-23 15:30:32,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:32,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:30:32,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940361395] [2020-12-23 15:30:32,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:30:32,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:30:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:30:32,288 INFO L87 Difference]: Start difference. First operand 2669 states and 3761 transitions. Second operand 4 states. [2020-12-23 15:30:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:32,484 INFO L93 Difference]: Finished difference Result 5322 states and 7506 transitions. [2020-12-23 15:30:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:30:32,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 15:30:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:32,498 INFO L225 Difference]: With dead ends: 5322 [2020-12-23 15:30:32,499 INFO L226 Difference]: Without dead ends: 2672 [2020-12-23 15:30:32,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:30:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2020-12-23 15:30:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 2671. [2020-12-23 15:30:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2020-12-23 15:30:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3763 transitions. [2020-12-23 15:30:32,656 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3763 transitions. Word has length 111 [2020-12-23 15:30:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:32,656 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3763 transitions. [2020-12-23 15:30:32,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:30:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3763 transitions. [2020-12-23 15:30:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 15:30:32,668 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:32,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:32,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 15:30:32,668 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:32,669 INFO L82 PathProgramCache]: Analyzing trace with hash -920493235, now seen corresponding path program 1 times [2020-12-23 15:30:32,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:32,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66712347] [2020-12-23 15:30:32,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:30:33,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66712347] [2020-12-23 15:30:33,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:30:33,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:30:33,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860141233] [2020-12-23 15:30:33,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:33,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:33,165 INFO L87 Difference]: Start difference. First operand 2671 states and 3763 transitions. Second operand 3 states. [2020-12-23 15:30:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:33,645 INFO L93 Difference]: Finished difference Result 5336 states and 7532 transitions. [2020-12-23 15:30:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:33,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 15:30:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:33,665 INFO L225 Difference]: With dead ends: 5336 [2020-12-23 15:30:33,665 INFO L226 Difference]: Without dead ends: 2684 [2020-12-23 15:30:33,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:30:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2020-12-23 15:30:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2020-12-23 15:30:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-12-23 15:30:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3776 transitions. [2020-12-23 15:30:33,877 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3776 transitions. Word has length 111 [2020-12-23 15:30:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:33,877 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 3776 transitions. [2020-12-23 15:30:33,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3776 transitions. [2020-12-23 15:30:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 15:30:33,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:33,889 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:33,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 15:30:33,889 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:33,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash -621044477, now seen corresponding path program 1 times [2020-12-23 15:30:33,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:33,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621680920] [2020-12-23 15:30:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:30:34,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621680920] [2020-12-23 15:30:34,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57602038] [2020-12-23 15:30:34,290 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 15:30:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:35,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:30:35,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 15:30:35,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:35,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-23 15:30:35,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870532339] [2020-12-23 15:30:35,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:30:35,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:35,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:30:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:35,784 INFO L87 Difference]: Start difference. First operand 2684 states and 3776 transitions. Second operand 6 states. [2020-12-23 15:30:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:36,408 INFO L93 Difference]: Finished difference Result 5394 states and 7622 transitions. [2020-12-23 15:30:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:30:36,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-12-23 15:30:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:36,423 INFO L225 Difference]: With dead ends: 5394 [2020-12-23 15:30:36,423 INFO L226 Difference]: Without dead ends: 2729 [2020-12-23 15:30:36,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2020-12-23 15:30:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2729. [2020-12-23 15:30:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2020-12-23 15:30:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 3821 transitions. [2020-12-23 15:30:36,622 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 3821 transitions. Word has length 113 [2020-12-23 15:30:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:36,623 INFO L481 AbstractCegarLoop]: Abstraction has 2729 states and 3821 transitions. [2020-12-23 15:30:36,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:30:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3821 transitions. [2020-12-23 15:30:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 15:30:36,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:36,633 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:36,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 15:30:36,847 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1109896179, now seen corresponding path program 2 times [2020-12-23 15:30:36,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:36,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393090254] [2020-12-23 15:30:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 15:30:37,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393090254] [2020-12-23 15:30:37,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316820191] [2020-12-23 15:30:37,238 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 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 15:30:38,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:38,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:38,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:30:38,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 15:30:38,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:38,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 15:30:38,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092541999] [2020-12-23 15:30:38,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:30:38,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:30:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:38,575 INFO L87 Difference]: Start difference. First operand 2729 states and 3821 transitions. Second operand 3 states. [2020-12-23 15:30:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:39,087 INFO L93 Difference]: Finished difference Result 5440 states and 7624 transitions. [2020-12-23 15:30:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:30:39,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 15:30:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:39,100 INFO L225 Difference]: With dead ends: 5440 [2020-12-23 15:30:39,100 INFO L226 Difference]: Without dead ends: 2730 [2020-12-23 15:30:39,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:30:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-12-23 15:30:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2730. [2020-12-23 15:30:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-23 15:30:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 3822 transitions. [2020-12-23 15:30:39,271 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 3822 transitions. Word has length 115 [2020-12-23 15:30:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:39,271 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 3822 transitions. [2020-12-23 15:30:39,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:30:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3822 transitions. [2020-12-23 15:30:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 15:30:39,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:39,282 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:39,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 15:30:39,494 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash 779637862, now seen corresponding path program 1 times [2020-12-23 15:30:39,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:39,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532226138] [2020-12-23 15:30:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 15:30:39,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532226138] [2020-12-23 15:30:39,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879009877] [2020-12-23 15:30:39,852 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 15:30:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:41,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:30:41,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 15:30:41,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:30:41,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 15:30:41,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387655477] [2020-12-23 15:30:41,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:30:41,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:30:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:41,384 INFO L87 Difference]: Start difference. First operand 2730 states and 3822 transitions. Second operand 8 states. [2020-12-23 15:30:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:42,049 INFO L93 Difference]: Finished difference Result 5470 states and 7682 transitions. [2020-12-23 15:30:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:30:42,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2020-12-23 15:30:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:42,063 INFO L225 Difference]: With dead ends: 5470 [2020-12-23 15:30:42,063 INFO L226 Difference]: Without dead ends: 2759 [2020-12-23 15:30:42,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:30:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2020-12-23 15:30:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2759. [2020-12-23 15:30:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2020-12-23 15:30:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3851 transitions. [2020-12-23 15:30:42,231 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3851 transitions. Word has length 116 [2020-12-23 15:30:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:42,232 INFO L481 AbstractCegarLoop]: Abstraction has 2759 states and 3851 transitions. [2020-12-23 15:30:42,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:30:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3851 transitions. [2020-12-23 15:30:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 15:30:42,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:42,243 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:42,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:30:42,456 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash -155725606, now seen corresponding path program 2 times [2020-12-23 15:30:42,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:42,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164130998] [2020-12-23 15:30:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 15:30:42,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164130998] [2020-12-23 15:30:42,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987158742] [2020-12-23 15:30:42,809 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 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 15:30:57,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:30:57,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:30:57,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 15:30:57,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:30:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 15:30:57,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:30:57,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-12-23 15:30:57,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281295654] [2020-12-23 15:30:57,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:30:57,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:30:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:30:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:30:57,541 INFO L87 Difference]: Start difference. First operand 2759 states and 3851 transitions. Second operand 5 states. [2020-12-23 15:30:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:30:59,004 INFO L93 Difference]: Finished difference Result 12339 states and 17332 transitions. [2020-12-23 15:30:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:30:59,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-12-23 15:30:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:30:59,042 INFO L225 Difference]: With dead ends: 12339 [2020-12-23 15:30:59,042 INFO L226 Difference]: Without dead ends: 9599 [2020-12-23 15:30:59,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-23 15:30:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9599 states. [2020-12-23 15:30:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9599 to 2762. [2020-12-23 15:30:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-12-23 15:30:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3854 transitions. [2020-12-23 15:30:59,285 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3854 transitions. Word has length 118 [2020-12-23 15:30:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:30:59,285 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 3854 transitions. [2020-12-23 15:30:59,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:30:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3854 transitions. [2020-12-23 15:30:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 15:30:59,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:30:59,296 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:30:59,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:30:59,497 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:30:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:30:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1121942990, now seen corresponding path program 1 times [2020-12-23 15:30:59,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:30:59,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762904494] [2020-12-23 15:30:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:30:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:30:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 15:30:59,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762904494] [2020-12-23 15:30:59,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749932813] [2020-12-23 15:30:59,881 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 15:31:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:01,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:31:01,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 15:31:01,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:01,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 15:31:01,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868376198] [2020-12-23 15:31:01,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:31:01,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:31:01,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:01,238 INFO L87 Difference]: Start difference. First operand 2762 states and 3854 transitions. Second operand 10 states. [2020-12-23 15:31:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:01,980 INFO L93 Difference]: Finished difference Result 5534 states and 7746 transitions. [2020-12-23 15:31:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 15:31:01,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-12-23 15:31:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:01,990 INFO L225 Difference]: With dead ends: 5534 [2020-12-23 15:31:01,991 INFO L226 Difference]: Without dead ends: 2791 [2020-12-23 15:31:01,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2020-12-23 15:31:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2791. [2020-12-23 15:31:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2020-12-23 15:31:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3883 transitions. [2020-12-23 15:31:02,234 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3883 transitions. Word has length 124 [2020-12-23 15:31:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:02,234 INFO L481 AbstractCegarLoop]: Abstraction has 2791 states and 3883 transitions. [2020-12-23 15:31:02,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:31:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3883 transitions. [2020-12-23 15:31:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 15:31:02,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:02,248 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:02,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 15:31:02,462 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2046764094, now seen corresponding path program 2 times [2020-12-23 15:31:02,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:02,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565065829] [2020-12-23 15:31:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 15:31:02,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565065829] [2020-12-23 15:31:02,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473609737] [2020-12-23 15:31:02,843 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 15:31:15,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:15,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:15,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 2356 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 15:31:15,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 15:31:15,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:15,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-12-23 15:31:15,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859803651] [2020-12-23 15:31:15,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:31:15,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:31:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:15,344 INFO L87 Difference]: Start difference. First operand 2791 states and 3883 transitions. Second operand 4 states. [2020-12-23 15:31:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:16,545 INFO L93 Difference]: Finished difference Result 8215 states and 11475 transitions. [2020-12-23 15:31:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:31:16,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2020-12-23 15:31:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:16,566 INFO L225 Difference]: With dead ends: 8215 [2020-12-23 15:31:16,566 INFO L226 Difference]: Without dead ends: 5443 [2020-12-23 15:31:16,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2020-12-23 15:31:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 2801. [2020-12-23 15:31:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2020-12-23 15:31:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3893 transitions. [2020-12-23 15:31:16,812 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3893 transitions. Word has length 126 [2020-12-23 15:31:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:16,812 INFO L481 AbstractCegarLoop]: Abstraction has 2801 states and 3893 transitions. [2020-12-23 15:31:16,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:31:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3893 transitions. [2020-12-23 15:31:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 15:31:16,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:16,822 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:17,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:17,023 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 96773182, now seen corresponding path program 1 times [2020-12-23 15:31:17,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:17,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320744485] [2020-12-23 15:31:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 15:31:17,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320744485] [2020-12-23 15:31:17,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855018441] [2020-12-23 15:31:17,486 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 15:31:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:18,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 15:31:18,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 15:31:18,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:18,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-23 15:31:18,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458374304] [2020-12-23 15:31:18,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 15:31:18,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 15:31:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:31:18,833 INFO L87 Difference]: Start difference. First operand 2801 states and 3893 transitions. Second operand 12 states. [2020-12-23 15:31:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:19,679 INFO L93 Difference]: Finished difference Result 5612 states and 7824 transitions. [2020-12-23 15:31:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 15:31:19,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2020-12-23 15:31:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:19,690 INFO L225 Difference]: With dead ends: 5612 [2020-12-23 15:31:19,690 INFO L226 Difference]: Without dead ends: 2830 [2020-12-23 15:31:19,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:31:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2020-12-23 15:31:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2020-12-23 15:31:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2020-12-23 15:31:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3922 transitions. [2020-12-23 15:31:19,923 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3922 transitions. Word has length 130 [2020-12-23 15:31:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:19,924 INFO L481 AbstractCegarLoop]: Abstraction has 2830 states and 3922 transitions. [2020-12-23 15:31:19,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 15:31:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3922 transitions. [2020-12-23 15:31:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 15:31:19,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:19,935 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:20,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:31:20,149 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1930986374, now seen corresponding path program 2 times [2020-12-23 15:31:20,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:20,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557407974] [2020-12-23 15:31:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 15:31:20,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557407974] [2020-12-23 15:31:20,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582201660] [2020-12-23 15:31:20,543 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 15:31:33,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:33,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:33,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 2392 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-23 15:31:33,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 15:31:33,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:33,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-12-23 15:31:33,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132541133] [2020-12-23 15:31:33,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:31:33,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:31:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:33,960 INFO L87 Difference]: Start difference. First operand 2830 states and 3922 transitions. Second operand 3 states. [2020-12-23 15:31:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:34,293 INFO L93 Difference]: Finished difference Result 6024 states and 8334 transitions. [2020-12-23 15:31:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:31:34,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2020-12-23 15:31:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:34,305 INFO L225 Difference]: With dead ends: 6024 [2020-12-23 15:31:34,305 INFO L226 Difference]: Without dead ends: 3213 [2020-12-23 15:31:34,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:31:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2020-12-23 15:31:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 2830. [2020-12-23 15:31:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2020-12-23 15:31:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3921 transitions. [2020-12-23 15:31:34,542 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3921 transitions. Word has length 132 [2020-12-23 15:31:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:34,542 INFO L481 AbstractCegarLoop]: Abstraction has 2830 states and 3921 transitions. [2020-12-23 15:31:34,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:31:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3921 transitions. [2020-12-23 15:31:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 15:31:34,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:34,552 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:34,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:31:34,753 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2068449918, now seen corresponding path program 1 times [2020-12-23 15:31:34,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:34,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499020195] [2020-12-23 15:31:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 15:31:35,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499020195] [2020-12-23 15:31:35,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634980754] [2020-12-23 15:31:35,181 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 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 15:31:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:36,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 2626 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 15:31:36,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 15:31:36,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:36,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-12-23 15:31:36,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144089984] [2020-12-23 15:31:36,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 15:31:36,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 15:31:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:31:36,588 INFO L87 Difference]: Start difference. First operand 2830 states and 3921 transitions. Second operand 14 states. [2020-12-23 15:31:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:37,476 INFO L93 Difference]: Finished difference Result 5670 states and 7880 transitions. [2020-12-23 15:31:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 15:31:37,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2020-12-23 15:31:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:37,487 INFO L225 Difference]: With dead ends: 5670 [2020-12-23 15:31:37,488 INFO L226 Difference]: Without dead ends: 2859 [2020-12-23 15:31:37,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2020-12-23 15:31:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-12-23 15:31:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2020-12-23 15:31:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2020-12-23 15:31:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 3950 transitions. [2020-12-23 15:31:37,740 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 3950 transitions. Word has length 134 [2020-12-23 15:31:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:37,740 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 3950 transitions. [2020-12-23 15:31:37,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 15:31:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3950 transitions. [2020-12-23 15:31:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 15:31:37,752 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:37,753 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:37,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:37,967 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash 170791106, now seen corresponding path program 2 times [2020-12-23 15:31:37,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:37,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706810832] [2020-12-23 15:31:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 15:31:38,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706810832] [2020-12-23 15:31:38,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939279856] [2020-12-23 15:31:38,399 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 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 15:31:50,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:31:50,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:31:50,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 2431 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 15:31:50,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 15:31:50,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:31:50,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-12-23 15:31:50,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761159960] [2020-12-23 15:31:50,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:31:50,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:50,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:31:50,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:50,814 INFO L87 Difference]: Start difference. First operand 2859 states and 3950 transitions. Second operand 3 states. [2020-12-23 15:31:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:51,128 INFO L93 Difference]: Finished difference Result 6098 states and 8406 transitions. [2020-12-23 15:31:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:31:51,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2020-12-23 15:31:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:51,142 INFO L225 Difference]: With dead ends: 6098 [2020-12-23 15:31:51,142 INFO L226 Difference]: Without dead ends: 3258 [2020-12-23 15:31:51,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:31:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2020-12-23 15:31:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2859. [2020-12-23 15:31:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2020-12-23 15:31:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 3949 transitions. [2020-12-23 15:31:51,407 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 3949 transitions. Word has length 136 [2020-12-23 15:31:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:51,408 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 3949 transitions. [2020-12-23 15:31:51,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:31:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3949 transitions. [2020-12-23 15:31:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 15:31:51,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:51,417 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:51,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:31:51,633 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2034918210, now seen corresponding path program 1 times [2020-12-23 15:31:51,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:51,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918828557] [2020-12-23 15:31:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 15:31:52,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918828557] [2020-12-23 15:31:52,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470602855] [2020-12-23 15:31:52,073 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 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 15:31:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:53,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:31:53,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:31:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 15:31:53,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:31:53,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-12-23 15:31:53,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50831927] [2020-12-23 15:31:53,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 15:31:53,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:31:53,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 15:31:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-12-23 15:31:53,650 INFO L87 Difference]: Start difference. First operand 2859 states and 3949 transitions. Second operand 16 states. [2020-12-23 15:31:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:31:54,741 INFO L93 Difference]: Finished difference Result 5728 states and 7936 transitions. [2020-12-23 15:31:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 15:31:54,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 138 [2020-12-23 15:31:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:31:54,756 INFO L225 Difference]: With dead ends: 5728 [2020-12-23 15:31:54,757 INFO L226 Difference]: Without dead ends: 2888 [2020-12-23 15:31:54,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-12-23 15:31:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-12-23 15:31:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2888. [2020-12-23 15:31:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2020-12-23 15:31:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3978 transitions. [2020-12-23 15:31:55,019 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3978 transitions. Word has length 138 [2020-12-23 15:31:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:31:55,020 INFO L481 AbstractCegarLoop]: Abstraction has 2888 states and 3978 transitions. [2020-12-23 15:31:55,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 15:31:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3978 transitions. [2020-12-23 15:31:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 15:31:55,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:31:55,029 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:31:55,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 15:31:55,243 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:31:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:31:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash -465251710, now seen corresponding path program 2 times [2020-12-23 15:31:55,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:31:55,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747183877] [2020-12-23 15:31:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:31:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:31:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 15:31:55,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747183877] [2020-12-23 15:31:55,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120852181] [2020-12-23 15:31:55,706 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:09,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:32:09,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:32:09,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 15:32:09,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:32:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-12-23 15:32:10,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:32:10,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2020-12-23 15:32:10,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990217289] [2020-12-23 15:32:10,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:32:10,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:32:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:32:10,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-12-23 15:32:10,151 INFO L87 Difference]: Start difference. First operand 2888 states and 3978 transitions. Second operand 7 states. [2020-12-23 15:32:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:32:13,705 INFO L93 Difference]: Finished difference Result 13184 states and 17987 transitions. [2020-12-23 15:32:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 15:32:13,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-12-23 15:32:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:32:13,737 INFO L225 Difference]: With dead ends: 13184 [2020-12-23 15:32:13,737 INFO L226 Difference]: Without dead ends: 10315 [2020-12-23 15:32:13,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2020-12-23 15:32:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10315 states. [2020-12-23 15:32:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10315 to 2933. [2020-12-23 15:32:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2020-12-23 15:32:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4036 transitions. [2020-12-23 15:32:14,132 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4036 transitions. Word has length 140 [2020-12-23 15:32:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:32:14,132 INFO L481 AbstractCegarLoop]: Abstraction has 2933 states and 4036 transitions. [2020-12-23 15:32:14,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:32:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4036 transitions. [2020-12-23 15:32:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 15:32:14,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:32:14,141 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:32:14,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:14,341 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:32:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:32:14,342 INFO L82 PathProgramCache]: Analyzing trace with hash 800799794, now seen corresponding path program 1 times [2020-12-23 15:32:14,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:32:14,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621987378] [2020-12-23 15:32:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:32:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 15:32:14,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621987378] [2020-12-23 15:32:14,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845497260] [2020-12-23 15:32:14,800 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:16,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 15:32:16,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:32:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 15:32:16,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:32:16,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-12-23 15:32:16,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928180608] [2020-12-23 15:32:16,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 15:32:16,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:32:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 15:32:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2020-12-23 15:32:16,529 INFO L87 Difference]: Start difference. First operand 2933 states and 4036 transitions. Second operand 18 states. [2020-12-23 15:32:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:32:17,769 INFO L93 Difference]: Finished difference Result 5876 states and 8110 transitions. [2020-12-23 15:32:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 15:32:17,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 152 [2020-12-23 15:32:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:32:17,777 INFO L225 Difference]: With dead ends: 5876 [2020-12-23 15:32:17,777 INFO L226 Difference]: Without dead ends: 2962 [2020-12-23 15:32:17,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2020-12-23 15:32:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-12-23 15:32:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2962. [2020-12-23 15:32:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2020-12-23 15:32:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 4065 transitions. [2020-12-23 15:32:18,108 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 4065 transitions. Word has length 152 [2020-12-23 15:32:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:32:18,108 INFO L481 AbstractCegarLoop]: Abstraction has 2962 states and 4065 transitions. [2020-12-23 15:32:18,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 15:32:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 4065 transitions. [2020-12-23 15:32:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 15:32:18,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:32:18,117 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:32:18,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 15:32:18,330 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:32:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:32:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2120759362, now seen corresponding path program 2 times [2020-12-23 15:32:18,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:32:18,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919702671] [2020-12-23 15:32:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:32:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-23 15:32:18,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919702671] [2020-12-23 15:32:18,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501261897] [2020-12-23 15:32:18,734 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:29,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 15:32:29,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:32:29,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 15:32:29,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:32:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 15:32:29,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:32:29,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-12-23 15:32:29,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111676658] [2020-12-23 15:32:29,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:32:29,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:32:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:32:29,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:32:29,714 INFO L87 Difference]: Start difference. First operand 2962 states and 4065 transitions. Second operand 3 states. [2020-12-23 15:32:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:32:30,448 INFO L93 Difference]: Finished difference Result 5909 states and 8115 transitions. [2020-12-23 15:32:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:32:30,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-12-23 15:32:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:32:30,454 INFO L225 Difference]: With dead ends: 5909 [2020-12-23 15:32:30,454 INFO L226 Difference]: Without dead ends: 2963 [2020-12-23 15:32:30,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:32:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-12-23 15:32:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2963. [2020-12-23 15:32:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2020-12-23 15:32:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4066 transitions. [2020-12-23 15:32:30,670 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4066 transitions. Word has length 154 [2020-12-23 15:32:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:32:30,670 INFO L481 AbstractCegarLoop]: Abstraction has 2963 states and 4066 transitions. [2020-12-23 15:32:30,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:32:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4066 transitions. [2020-12-23 15:32:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 15:32:30,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:32:30,682 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:32:30,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:30,883 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:32:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:32:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1228875380, now seen corresponding path program 1 times [2020-12-23 15:32:30,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:32:30,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10394594] [2020-12-23 15:32:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:32:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-12-23 15:32:31,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10394594] [2020-12-23 15:32:31,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400016747] [2020-12-23 15:32:31,352 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:32:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:32,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 2809 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 15:32:32,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:32:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-12-23 15:32:33,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:32:33,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-12-23 15:32:33,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706931428] [2020-12-23 15:32:33,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 15:32:33,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:32:33,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 15:32:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-12-23 15:32:33,102 INFO L87 Difference]: Start difference. First operand 2963 states and 4066 transitions. Second operand 20 states. [2020-12-23 15:32:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:32:34,493 INFO L93 Difference]: Finished difference Result 5935 states and 8169 transitions. [2020-12-23 15:32:34,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 15:32:34,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2020-12-23 15:32:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:32:34,502 INFO L225 Difference]: With dead ends: 5935 [2020-12-23 15:32:34,503 INFO L226 Difference]: Without dead ends: 2992 [2020-12-23 15:32:34,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-12-23 15:32:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-12-23 15:32:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2992. [2020-12-23 15:32:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2020-12-23 15:32:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4095 transitions. [2020-12-23 15:32:34,813 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4095 transitions. Word has length 155 [2020-12-23 15:32:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:32:34,813 INFO L481 AbstractCegarLoop]: Abstraction has 2992 states and 4095 transitions. [2020-12-23 15:32:34,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 15:32:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4095 transitions. [2020-12-23 15:32:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:32:34,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:32:34,821 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:32:35,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 15:32:35,037 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:32:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:32:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1792442880, now seen corresponding path program 2 times [2020-12-23 15:32:35,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:32:35,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558003131] [2020-12-23 15:32:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:32:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:32:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-12-23 15:32:35,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558003131] [2020-12-23 15:32:35,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522082623] [2020-12-23 15:32:35,580 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true