/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-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:41:46,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:41:46,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:41:46,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:41:46,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:41:46,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:41:46,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:41:46,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:41:46,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:41:46,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:41:46,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:41:46,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:41:46,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:41:46,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:41:46,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:41:46,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:41:46,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:41:46,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:41:46,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:41:46,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:41:46,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:41:46,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:41:46,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:41:46,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:41:46,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:41:46,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:41:46,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:41:46,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:41:46,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:41:46,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:41:46,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:41:46,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:41:46,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:41:46,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:41:46,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:41:46,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:41:46,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:41:46,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:41:46,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:41:46,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:41:46,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:41:46,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:41:46,981 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:41:46,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:41:46,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:41:46,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:41:46,988 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:41:46,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:41:46,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:41:46,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:41:46,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:41:46,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:41:46,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:41:46,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:41:46,991 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:41:46,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:41:46,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:41:46,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:41:46,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:41:46,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:41:46,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:41:46,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:41:46,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:41:46,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:41:46,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:41:46,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:41:46,994 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:41:46,994 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 [2021-01-07 01:41:47,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:41:47,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:41:47,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:41:47,463 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:41:47,464 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:41:47,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:47,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9d566afd2/5506b81b80e24c71b3d0cc8e46798512/FLAG011132fc9 [2021-01-07 01:41:48,812 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:41:48,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:48,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9d566afd2/5506b81b80e24c71b3d0cc8e46798512/FLAG011132fc9 [2021-01-07 01:41:49,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9d566afd2/5506b81b80e24c71b3d0cc8e46798512 [2021-01-07 01:41:49,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:41:49,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:41:49,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:49,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:41:49,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:41:49,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:49" (1/1) ... [2021-01-07 01:41:49,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa0d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:49, skipping insertion in model container [2021-01-07 01:41:49,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:49" (1/1) ... [2021-01-07 01:41:49,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:41:49,265 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~__vpp_verify~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~nid,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] 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[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~gfp_mask,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~gfp_mask,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~page~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[185],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~pnd~0,] left hand side expression in assignment: lhs: VariableLHS[~req~0,] left hand side expression in assignment: lhs: VariableLHS[~req~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~req~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[42],StructAccessExpression[IdentifierExpression[~pnd~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[220],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pnd~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[204],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[42],StructAccessExpression[IdentifierExpression[~pnd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~page~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~req,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~pnd~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~pnd~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~pnd~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~req,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[260],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[196],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~pnd~3,] left hand side expression in assignment: lhs: VariableLHS[~num~0,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~req~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~3,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~pnd~3,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~pnd~4,] left hand side expression in assignment: lhs: VariableLHS[~num~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~req~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~pnd~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~1,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~req~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~req~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[412],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[372],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[388],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[416],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[396],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[412],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[418],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem223,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[457],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[798],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1078],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[5]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[6]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ifname~0,],[IntegerLiteral[7]]] left hand side expression in assignment: lhs: VariableLHS[~union_header~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~usbdev~0,] left hand side expression in assignment: lhs: VariableLHS[~phonet~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~dlen~0,] left hand side expression in assignment: lhs: VariableLHS[~union_header~0,] left hand side expression in assignment: lhs: VariableLHS[~phonet~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~data_intf~0,] left hand side expression in assignment: lhs: VariableLHS[~data_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~data_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~pnd~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1118],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~3,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~pnd~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],StructAccessExpression[IdentifierExpression[~pnd~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~usbpn_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~usbpn_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~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~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] 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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~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_1~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___5~2,] 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[~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[~ldv_retval_3~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_retval_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[~usb_counter~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[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] 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[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~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[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] [2021-01-07 01:41:50,570 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-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i[188986,188999] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~value~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnInt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulk~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] [2021-01-07 01:41:50,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:50,666 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~__vpp_verify~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~pscr_ret__~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~nid,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] 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[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~gfp_mask,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~gfp_mask,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~page~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[185],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~pnd~0,] left hand side expression in assignment: lhs: VariableLHS[~req~0,] left hand side expression in assignment: lhs: VariableLHS[~req~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~req~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[42],StructAccessExpression[IdentifierExpression[~pnd~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[220],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~pnd~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[204],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[42],StructAccessExpression[IdentifierExpression[~pnd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~page~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~req,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~pnd~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~pnd~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~page~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~pnd~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~req,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[260],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[196],StructAccessExpression[IdentifierExpression[~dev~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~pnd~3,] left hand side expression in assignment: lhs: VariableLHS[~num~0,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~req~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~3,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~pnd~3,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~pnd~4,] left hand side expression in assignment: lhs: VariableLHS[~num~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~req~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~pnd~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~1,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~req~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~req~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~req~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[412],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[372],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[388],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[416],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[396],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[412],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[418],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem227,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[457],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[798],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1078],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ifname~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~#ifname~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~union_header~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~usbdev~0,] left hand side expression in assignment: lhs: VariableLHS[~phonet~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~dlen~0,] left hand side expression in assignment: lhs: VariableLHS[~union_header~0,] left hand side expression in assignment: lhs: VariableLHS[~phonet~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~data_intf~0,] left hand side expression in assignment: lhs: VariableLHS[~data_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~data_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~pnd~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1118],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~pnd~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~pnd~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pnd~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],StructAccessExpression[IdentifierExpression[~pnd~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~usbpn_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~usbpn_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~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~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] 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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~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_1~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___5~2,] 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[~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[~ldv_retval_3~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_retval_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[~usb_counter~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[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] 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[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~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[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] [2021-01-07 01:41:51,121 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-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i[188986,188999] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~value~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnInt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulk~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~skb~2,],offset]]]] [2021-01-07 01:41:51,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:51,375 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:41:51,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51 WrapperNode [2021-01-07 01:41:51,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:51,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:51,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:41:51,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:41:51,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:51,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:41:51,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:41:51,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:41:51,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:51,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:52,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (1/1) ... [2021-01-07 01:41:52,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:41:52,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:41:52,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:41:52,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:41:52,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (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 [2021-01-07 01:41:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:41:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2021-01-07 01:41:52,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2021-01-07 01:41:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:41:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:41:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:41:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-01-07 01:41:52,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-01-07 01:41:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-01-07 01:41:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure rx_submit [2021-01-07 01:41:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_submit [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-01-07 01:41:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-01-07 01:41:52,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-01-07 01:41:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:41:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:41:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:41:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:41:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:41:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:41:52,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:41:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure rx_complete [2021-01-07 01:41:52,164 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_complete [2021-01-07 01:41:58,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:41:58,099 INFO L299 CfgBuilder]: Removed 477 assume(true) statements. [2021-01-07 01:41:58,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:58 BoogieIcfgContainer [2021-01-07 01:41:58,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:41:58,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:41:58,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:41:58,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:41:58,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:41:49" (1/3) ... [2021-01-07 01:41:58,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493ea626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:58, skipping insertion in model container [2021-01-07 01:41:58,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:51" (2/3) ... [2021-01-07 01:41:58,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493ea626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:58, skipping insertion in model container [2021-01-07 01:41:58,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:58" (3/3) ... [2021-01-07 01:41:58,112 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:58,119 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:41:58,125 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-07 01:41:58,147 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-07 01:41:58,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:41:58,181 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:41:58,181 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:41:58,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:41:58,181 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:41:58,181 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:41:58,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:41:58,182 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:41:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states. [2021-01-07 01:41:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 01:41:58,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:58,226 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, 1] [2021-01-07 01:41:58,226 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:58,235 INFO L82 PathProgramCache]: Analyzing trace with hash -734751262, now seen corresponding path program 1 times [2021-01-07 01:41:58,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:58,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538047383] [2021-01-07 01:41:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:41:58,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538047383] [2021-01-07 01:41:58,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:58,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:41:58,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747598880] [2021-01-07 01:41:58,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:41:58,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:41:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:41:58,824 INFO L87 Difference]: Start difference. First operand 508 states. Second operand 2 states. [2021-01-07 01:41:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:58,915 INFO L93 Difference]: Finished difference Result 1012 states and 1441 transitions. [2021-01-07 01:41:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:41:58,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2021-01-07 01:41:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:58,951 INFO L225 Difference]: With dead ends: 1012 [2021-01-07 01:41:58,952 INFO L226 Difference]: Without dead ends: 497 [2021-01-07 01:41:58,964 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 [2021-01-07 01:41:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-01-07 01:41:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2021-01-07 01:41:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2021-01-07 01:41:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 677 transitions. [2021-01-07 01:41:59,074 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 677 transitions. Word has length 31 [2021-01-07 01:41:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:59,074 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 677 transitions. [2021-01-07 01:41:59,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:41:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 677 transitions. [2021-01-07 01:41:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 01:41:59,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:59,076 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, 1] [2021-01-07 01:41:59,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:41:59,077 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2099080988, now seen corresponding path program 1 times [2021-01-07 01:41:59,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:59,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076027958] [2021-01-07 01:41:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:41:59,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076027958] [2021-01-07 01:41:59,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:59,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:59,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490729448] [2021-01-07 01:41:59,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:59,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:59,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:59,353 INFO L87 Difference]: Start difference. First operand 497 states and 677 transitions. Second operand 3 states. [2021-01-07 01:42:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:00,096 INFO L93 Difference]: Finished difference Result 1423 states and 1959 transitions. [2021-01-07 01:42:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:00,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2021-01-07 01:42:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:00,107 INFO L225 Difference]: With dead ends: 1423 [2021-01-07 01:42:00,108 INFO L226 Difference]: Without dead ends: 947 [2021-01-07 01:42:00,111 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 [2021-01-07 01:42:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-01-07 01:42:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2021-01-07 01:42:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2021-01-07 01:42:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1302 transitions. [2021-01-07 01:42:00,179 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1302 transitions. Word has length 31 [2021-01-07 01:42:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:00,180 INFO L481 AbstractCegarLoop]: Abstraction has 947 states and 1302 transitions. [2021-01-07 01:42:00,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1302 transitions. [2021-01-07 01:42:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 01:42:00,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:00,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:00,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:42:00,193 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1915410345, now seen corresponding path program 1 times [2021-01-07 01:42:00,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:00,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195716435] [2021-01-07 01:42:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:00,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195716435] [2021-01-07 01:42:00,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:00,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:00,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226648354] [2021-01-07 01:42:00,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:00,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:00,517 INFO L87 Difference]: Start difference. First operand 947 states and 1302 transitions. Second operand 3 states. [2021-01-07 01:42:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:00,594 INFO L93 Difference]: Finished difference Result 977 states and 1330 transitions. [2021-01-07 01:42:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:00,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2021-01-07 01:42:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:00,604 INFO L225 Difference]: With dead ends: 977 [2021-01-07 01:42:00,604 INFO L226 Difference]: Without dead ends: 962 [2021-01-07 01:42:00,605 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 [2021-01-07 01:42:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-01-07 01:42:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 947. [2021-01-07 01:42:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2021-01-07 01:42:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1301 transitions. [2021-01-07 01:42:00,652 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1301 transitions. Word has length 40 [2021-01-07 01:42:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:00,653 INFO L481 AbstractCegarLoop]: Abstraction has 947 states and 1301 transitions. [2021-01-07 01:42:00,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1301 transitions. [2021-01-07 01:42:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 01:42:00,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:00,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:00,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:42:00,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1915469927, now seen corresponding path program 1 times [2021-01-07 01:42:00,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:00,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911051413] [2021-01-07 01:42:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:00,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911051413] [2021-01-07 01:42:00,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:00,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:00,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078310635] [2021-01-07 01:42:00,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:00,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:00,933 INFO L87 Difference]: Start difference. First operand 947 states and 1301 transitions. Second operand 3 states. [2021-01-07 01:42:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:01,130 INFO L93 Difference]: Finished difference Result 2797 states and 3904 transitions. [2021-01-07 01:42:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:01,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2021-01-07 01:42:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:01,146 INFO L225 Difference]: With dead ends: 2797 [2021-01-07 01:42:01,146 INFO L226 Difference]: Without dead ends: 1871 [2021-01-07 01:42:01,150 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 [2021-01-07 01:42:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-01-07 01:42:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1859. [2021-01-07 01:42:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1859 states. [2021-01-07 01:42:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2572 transitions. [2021-01-07 01:42:01,255 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2572 transitions. Word has length 40 [2021-01-07 01:42:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:01,255 INFO L481 AbstractCegarLoop]: Abstraction has 1859 states and 2572 transitions. [2021-01-07 01:42:01,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2572 transitions. [2021-01-07 01:42:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 01:42:01,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:01,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:01,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:42:01,257 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -749966933, now seen corresponding path program 1 times [2021-01-07 01:42:01,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:01,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085600117] [2021-01-07 01:42:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:01,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085600117] [2021-01-07 01:42:01,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:01,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:01,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660380624] [2021-01-07 01:42:01,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:01,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:01,431 INFO L87 Difference]: Start difference. First operand 1859 states and 2572 transitions. Second operand 3 states. [2021-01-07 01:42:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:01,549 INFO L93 Difference]: Finished difference Result 1859 states and 2572 transitions. [2021-01-07 01:42:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:01,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-07 01:42:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:01,563 INFO L225 Difference]: With dead ends: 1859 [2021-01-07 01:42:01,563 INFO L226 Difference]: Without dead ends: 1857 [2021-01-07 01:42:01,564 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 [2021-01-07 01:42:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2021-01-07 01:42:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2021-01-07 01:42:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2021-01-07 01:42:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2570 transitions. [2021-01-07 01:42:01,675 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2570 transitions. Word has length 41 [2021-01-07 01:42:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:01,676 INFO L481 AbstractCegarLoop]: Abstraction has 1857 states and 2570 transitions. [2021-01-07 01:42:01,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2570 transitions. [2021-01-07 01:42:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 01:42:01,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:01,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:01,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:42:01,678 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1774130959, now seen corresponding path program 1 times [2021-01-07 01:42:01,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:01,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872426525] [2021-01-07 01:42:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:01,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872426525] [2021-01-07 01:42:01,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:01,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:01,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498812506] [2021-01-07 01:42:01,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:01,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:01,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:01,816 INFO L87 Difference]: Start difference. First operand 1857 states and 2570 transitions. Second operand 3 states. [2021-01-07 01:42:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:01,905 INFO L93 Difference]: Finished difference Result 1857 states and 2570 transitions. [2021-01-07 01:42:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:01,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-07 01:42:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:01,918 INFO L225 Difference]: With dead ends: 1857 [2021-01-07 01:42:01,918 INFO L226 Difference]: Without dead ends: 1855 [2021-01-07 01:42:01,920 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 [2021-01-07 01:42:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-01-07 01:42:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1855. [2021-01-07 01:42:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2021-01-07 01:42:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2568 transitions. [2021-01-07 01:42:02,028 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2568 transitions. Word has length 42 [2021-01-07 01:42:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:02,028 INFO L481 AbstractCegarLoop]: Abstraction has 1855 states and 2568 transitions. [2021-01-07 01:42:02,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2568 transitions. [2021-01-07 01:42:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 01:42:02,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:02,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:02,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:42:02,032 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:02,032 INFO L82 PathProgramCache]: Analyzing trace with hash 836522613, now seen corresponding path program 1 times [2021-01-07 01:42:02,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:02,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85610138] [2021-01-07 01:42:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:02,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85610138] [2021-01-07 01:42:02,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:02,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:02,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949454750] [2021-01-07 01:42:02,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:02,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:02,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:02,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:02,222 INFO L87 Difference]: Start difference. First operand 1855 states and 2568 transitions. Second operand 3 states. [2021-01-07 01:42:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:02,352 INFO L93 Difference]: Finished difference Result 1855 states and 2568 transitions. [2021-01-07 01:42:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:02,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-01-07 01:42:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:02,366 INFO L225 Difference]: With dead ends: 1855 [2021-01-07 01:42:02,366 INFO L226 Difference]: Without dead ends: 1853 [2021-01-07 01:42:02,368 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 [2021-01-07 01:42:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2021-01-07 01:42:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2021-01-07 01:42:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2021-01-07 01:42:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2566 transitions. [2021-01-07 01:42:02,499 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2566 transitions. Word has length 43 [2021-01-07 01:42:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:02,499 INFO L481 AbstractCegarLoop]: Abstraction has 1853 states and 2566 transitions. [2021-01-07 01:42:02,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2566 transitions. [2021-01-07 01:42:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 01:42:02,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:02,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:02,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:42:02,501 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 162404731, now seen corresponding path program 1 times [2021-01-07 01:42:02,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:02,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293797442] [2021-01-07 01:42:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:02,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293797442] [2021-01-07 01:42:02,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:02,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:02,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670270571] [2021-01-07 01:42:02,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:02,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:02,652 INFO L87 Difference]: Start difference. First operand 1853 states and 2566 transitions. Second operand 3 states. [2021-01-07 01:42:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:02,753 INFO L93 Difference]: Finished difference Result 1853 states and 2566 transitions. [2021-01-07 01:42:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:02,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 01:42:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:02,765 INFO L225 Difference]: With dead ends: 1853 [2021-01-07 01:42:02,765 INFO L226 Difference]: Without dead ends: 1844 [2021-01-07 01:42:02,766 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 [2021-01-07 01:42:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2021-01-07 01:42:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2021-01-07 01:42:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2021-01-07 01:42:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2555 transitions. [2021-01-07 01:42:02,882 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2555 transitions. Word has length 44 [2021-01-07 01:42:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:02,883 INFO L481 AbstractCegarLoop]: Abstraction has 1844 states and 2555 transitions. [2021-01-07 01:42:02,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2555 transitions. [2021-01-07 01:42:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 01:42:02,888 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:02,888 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] [2021-01-07 01:42:02,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:42:02,889 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 941641653, now seen corresponding path program 1 times [2021-01-07 01:42:02,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:02,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901058148] [2021-01-07 01:42:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:03,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901058148] [2021-01-07 01:42:03,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:03,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:03,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602911638] [2021-01-07 01:42:03,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:03,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:03,037 INFO L87 Difference]: Start difference. First operand 1844 states and 2555 transitions. Second operand 3 states. [2021-01-07 01:42:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:03,406 INFO L93 Difference]: Finished difference Result 5154 states and 7179 transitions. [2021-01-07 01:42:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:03,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-07 01:42:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:03,434 INFO L225 Difference]: With dead ends: 5154 [2021-01-07 01:42:03,435 INFO L226 Difference]: Without dead ends: 3331 [2021-01-07 01:42:03,443 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 [2021-01-07 01:42:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-01-07 01:42:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3146. [2021-01-07 01:42:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2021-01-07 01:42:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4425 transitions. [2021-01-07 01:42:03,685 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4425 transitions. Word has length 65 [2021-01-07 01:42:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:03,686 INFO L481 AbstractCegarLoop]: Abstraction has 3146 states and 4425 transitions. [2021-01-07 01:42:03,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4425 transitions. [2021-01-07 01:42:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 01:42:03,692 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:03,692 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-07 01:42:03,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:42:03,694 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -504912965, now seen corresponding path program 1 times [2021-01-07 01:42:03,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:03,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678994955] [2021-01-07 01:42:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:42:03,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678994955] [2021-01-07 01:42:03,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:03,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:03,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741869481] [2021-01-07 01:42:03,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:03,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:03,833 INFO L87 Difference]: Start difference. First operand 3146 states and 4425 transitions. Second operand 3 states. [2021-01-07 01:42:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:04,270 INFO L93 Difference]: Finished difference Result 8831 states and 12454 transitions. [2021-01-07 01:42:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:04,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-07 01:42:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:04,313 INFO L225 Difference]: With dead ends: 8831 [2021-01-07 01:42:04,313 INFO L226 Difference]: Without dead ends: 5706 [2021-01-07 01:42:04,324 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 [2021-01-07 01:42:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2021-01-07 01:42:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5694. [2021-01-07 01:42:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5694 states. [2021-01-07 01:42:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 8033 transitions. [2021-01-07 01:42:04,671 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 8033 transitions. Word has length 116 [2021-01-07 01:42:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:04,672 INFO L481 AbstractCegarLoop]: Abstraction has 5694 states and 8033 transitions. [2021-01-07 01:42:04,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 8033 transitions. [2021-01-07 01:42:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-07 01:42:04,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:04,685 INFO L422 BasicCegarLoop]: trace histogram [4, 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] [2021-01-07 01:42:04,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:42:04,685 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1512029252, now seen corresponding path program 1 times [2021-01-07 01:42:04,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:04,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471561385] [2021-01-07 01:42:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:42:04,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471561385] [2021-01-07 01:42:04,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:04,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:04,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106299397] [2021-01-07 01:42:04,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:04,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:04,856 INFO L87 Difference]: Start difference. First operand 5694 states and 8033 transitions. Second operand 3 states. [2021-01-07 01:42:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:05,558 INFO L93 Difference]: Finished difference Result 13504 states and 19069 transitions. [2021-01-07 01:42:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:05,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2021-01-07 01:42:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:05,619 INFO L225 Difference]: With dead ends: 13504 [2021-01-07 01:42:05,619 INFO L226 Difference]: Without dead ends: 7831 [2021-01-07 01:42:05,641 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 [2021-01-07 01:42:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7831 states. [2021-01-07 01:42:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7831 to 5774. [2021-01-07 01:42:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5774 states. [2021-01-07 01:42:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 8161 transitions. [2021-01-07 01:42:06,006 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 8161 transitions. Word has length 124 [2021-01-07 01:42:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:06,006 INFO L481 AbstractCegarLoop]: Abstraction has 5774 states and 8161 transitions. [2021-01-07 01:42:06,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 8161 transitions. [2021-01-07 01:42:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:42:06,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:06,066 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:06,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:42:06,066 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1964894389, now seen corresponding path program 1 times [2021-01-07 01:42:06,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:06,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255694207] [2021-01-07 01:42:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:42:06,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255694207] [2021-01-07 01:42:06,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:06,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:06,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11324342] [2021-01-07 01:42:06,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:06,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:06,271 INFO L87 Difference]: Start difference. First operand 5774 states and 8161 transitions. Second operand 3 states. [2021-01-07 01:42:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:06,735 INFO L93 Difference]: Finished difference Result 11535 states and 16315 transitions. [2021-01-07 01:42:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:06,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-07 01:42:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:06,778 INFO L225 Difference]: With dead ends: 11535 [2021-01-07 01:42:06,779 INFO L226 Difference]: Without dead ends: 5782 [2021-01-07 01:42:06,802 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 [2021-01-07 01:42:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2021-01-07 01:42:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5782. [2021-01-07 01:42:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5782 states. [2021-01-07 01:42:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 8169 transitions. [2021-01-07 01:42:07,237 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 8169 transitions. Word has length 131 [2021-01-07 01:42:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:07,238 INFO L481 AbstractCegarLoop]: Abstraction has 5782 states and 8169 transitions. [2021-01-07 01:42:07,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 8169 transitions. [2021-01-07 01:42:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:42:07,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:07,244 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:07,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:42:07,245 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1376132749, now seen corresponding path program 1 times [2021-01-07 01:42:07,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:07,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456223180] [2021-01-07 01:42:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:42:07,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456223180] [2021-01-07 01:42:07,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:07,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:07,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473489403] [2021-01-07 01:42:07,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:07,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:07,554 INFO L87 Difference]: Start difference. First operand 5782 states and 8169 transitions. Second operand 3 states. [2021-01-07 01:42:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:09,622 INFO L93 Difference]: Finished difference Result 12168 states and 17268 transitions. [2021-01-07 01:42:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:09,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-07 01:42:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:09,659 INFO L225 Difference]: With dead ends: 12168 [2021-01-07 01:42:09,660 INFO L226 Difference]: Without dead ends: 6407 [2021-01-07 01:42:09,681 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 [2021-01-07 01:42:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2021-01-07 01:42:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6310. [2021-01-07 01:42:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6310 states. [2021-01-07 01:42:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6310 states to 6310 states and 8926 transitions. [2021-01-07 01:42:10,120 INFO L78 Accepts]: Start accepts. Automaton has 6310 states and 8926 transitions. Word has length 131 [2021-01-07 01:42:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:10,121 INFO L481 AbstractCegarLoop]: Abstraction has 6310 states and 8926 transitions. [2021-01-07 01:42:10,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6310 states and 8926 transitions. [2021-01-07 01:42:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-07 01:42:10,127 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:10,128 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:10,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 01:42:10,128 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -329397949, now seen corresponding path program 1 times [2021-01-07 01:42:10,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:10,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972160730] [2021-01-07 01:42:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 01:42:10,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972160730] [2021-01-07 01:42:10,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:10,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:10,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421217134] [2021-01-07 01:42:10,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:10,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:10,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:10,371 INFO L87 Difference]: Start difference. First operand 6310 states and 8926 transitions. Second operand 3 states. [2021-01-07 01:42:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:12,060 INFO L93 Difference]: Finished difference Result 14840 states and 21114 transitions. [2021-01-07 01:42:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:12,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2021-01-07 01:42:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:12,102 INFO L225 Difference]: With dead ends: 14840 [2021-01-07 01:42:12,103 INFO L226 Difference]: Without dead ends: 8551 [2021-01-07 01:42:12,125 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 [2021-01-07 01:42:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8551 states. [2021-01-07 01:42:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8551 to 8422. [2021-01-07 01:42:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8422 states. [2021-01-07 01:42:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8422 states to 8422 states and 11975 transitions. [2021-01-07 01:42:12,600 INFO L78 Accepts]: Start accepts. Automaton has 8422 states and 11975 transitions. Word has length 145 [2021-01-07 01:42:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:12,601 INFO L481 AbstractCegarLoop]: Abstraction has 8422 states and 11975 transitions. [2021-01-07 01:42:12,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8422 states and 11975 transitions. [2021-01-07 01:42:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 01:42:12,611 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:12,612 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:12,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 01:42:12,612 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1089432950, now seen corresponding path program 1 times [2021-01-07 01:42:12,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:12,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235252198] [2021-01-07 01:42:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-07 01:42:12,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235252198] [2021-01-07 01:42:12,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:12,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:12,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580705475] [2021-01-07 01:42:12,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:12,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:12,864 INFO L87 Difference]: Start difference. First operand 8422 states and 11975 transitions. Second operand 4 states. [2021-01-07 01:42:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:14,423 INFO L93 Difference]: Finished difference Result 22696 states and 32166 transitions. [2021-01-07 01:42:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:14,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-07 01:42:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:14,482 INFO L225 Difference]: With dead ends: 22696 [2021-01-07 01:42:14,483 INFO L226 Difference]: Without dead ends: 14295 [2021-01-07 01:42:14,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14295 states. [2021-01-07 01:42:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14295 to 13602. [2021-01-07 01:42:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13602 states. [2021-01-07 01:42:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13602 states to 13602 states and 19330 transitions. [2021-01-07 01:42:15,323 INFO L78 Accepts]: Start accepts. Automaton has 13602 states and 19330 transitions. Word has length 157 [2021-01-07 01:42:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:15,324 INFO L481 AbstractCegarLoop]: Abstraction has 13602 states and 19330 transitions. [2021-01-07 01:42:15,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13602 states and 19330 transitions. [2021-01-07 01:42:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 01:42:15,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:15,333 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:15,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 01:42:15,334 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1790497528, now seen corresponding path program 1 times [2021-01-07 01:42:15,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:15,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438813272] [2021-01-07 01:42:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:42:15,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438813272] [2021-01-07 01:42:15,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057449104] [2021-01-07 01:42:15,807 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 [2021-01-07 01:42:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:16,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:42:16,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:42:17,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:17,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-01-07 01:42:17,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592015781] [2021-01-07 01:42:17,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:17,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:17,061 INFO L87 Difference]: Start difference. First operand 13602 states and 19330 transitions. Second operand 5 states. [2021-01-07 01:42:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:20,872 INFO L93 Difference]: Finished difference Result 54344 states and 77249 transitions. [2021-01-07 01:42:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:20,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2021-01-07 01:42:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:21,211 INFO L225 Difference]: With dead ends: 54344 [2021-01-07 01:42:21,211 INFO L226 Difference]: Without dead ends: 54339 [2021-01-07 01:42:21,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54339 states. [2021-01-07 01:42:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54339 to 54146. [2021-01-07 01:42:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54146 states. [2021-01-07 01:42:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54146 states to 54146 states and 76991 transitions. [2021-01-07 01:42:24,948 INFO L78 Accepts]: Start accepts. Automaton has 54146 states and 76991 transitions. Word has length 157 [2021-01-07 01:42:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:24,949 INFO L481 AbstractCegarLoop]: Abstraction has 54146 states and 76991 transitions. [2021-01-07 01:42:24,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 54146 states and 76991 transitions. [2021-01-07 01:42:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-07 01:42:24,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:24,989 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:25,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 01:42:25,203 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash -120785909, now seen corresponding path program 1 times [2021-01-07 01:42:25,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:25,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677471033] [2021-01-07 01:42:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-07 01:42:25,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677471033] [2021-01-07 01:42:25,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:25,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:25,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139823482] [2021-01-07 01:42:25,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:25,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:25,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:25,737 INFO L87 Difference]: Start difference. First operand 54146 states and 76991 transitions. Second operand 3 states. [2021-01-07 01:42:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:29,225 INFO L93 Difference]: Finished difference Result 108271 states and 153959 transitions. [2021-01-07 01:42:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:29,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2021-01-07 01:42:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:29,435 INFO L225 Difference]: With dead ends: 108271 [2021-01-07 01:42:29,436 INFO L226 Difference]: Without dead ends: 50850 [2021-01-07 01:42:29,554 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 [2021-01-07 01:42:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50850 states. [2021-01-07 01:42:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50850 to 50769. [2021-01-07 01:42:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2021-01-07 01:42:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 71987 transitions. [2021-01-07 01:42:32,074 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 71987 transitions. Word has length 166 [2021-01-07 01:42:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:32,075 INFO L481 AbstractCegarLoop]: Abstraction has 50769 states and 71987 transitions. [2021-01-07 01:42:32,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 71987 transitions. [2021-01-07 01:42:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-07 01:42:32,114 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:32,114 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:32,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 01:42:32,114 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 554374217, now seen corresponding path program 1 times [2021-01-07 01:42:32,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:32,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484329960] [2021-01-07 01:42:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-07 01:42:32,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484329960] [2021-01-07 01:42:32,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:32,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:32,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635440865] [2021-01-07 01:42:32,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:32,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:32,259 INFO L87 Difference]: Start difference. First operand 50769 states and 71987 transitions. Second operand 3 states. [2021-01-07 01:42:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:34,912 INFO L93 Difference]: Finished difference Result 74203 states and 105305 transitions. [2021-01-07 01:42:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:34,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2021-01-07 01:42:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:35,076 INFO L225 Difference]: With dead ends: 74203 [2021-01-07 01:42:35,076 INFO L226 Difference]: Without dead ends: 23454 [2021-01-07 01:42:35,201 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 [2021-01-07 01:42:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23454 states. [2021-01-07 01:42:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23454 to 23454. [2021-01-07 01:42:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23454 states. [2021-01-07 01:42:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23454 states to 23454 states and 33339 transitions. [2021-01-07 01:42:36,632 INFO L78 Accepts]: Start accepts. Automaton has 23454 states and 33339 transitions. Word has length 166 [2021-01-07 01:42:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:36,633 INFO L481 AbstractCegarLoop]: Abstraction has 23454 states and 33339 transitions. [2021-01-07 01:42:36,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 23454 states and 33339 transitions. [2021-01-07 01:42:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-07 01:42:36,647 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:36,647 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:36,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 01:42:36,648 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -109671502, now seen corresponding path program 1 times [2021-01-07 01:42:36,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:36,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816124130] [2021-01-07 01:42:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-07 01:42:36,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816124130] [2021-01-07 01:42:36,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:36,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:36,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183995366] [2021-01-07 01:42:36,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:36,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:36,812 INFO L87 Difference]: Start difference. First operand 23454 states and 33339 transitions. Second operand 3 states. [2021-01-07 01:42:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:38,272 INFO L93 Difference]: Finished difference Result 35119 states and 49912 transitions. [2021-01-07 01:42:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:38,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-07 01:42:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:38,317 INFO L225 Difference]: With dead ends: 35119 [2021-01-07 01:42:38,317 INFO L226 Difference]: Without dead ends: 11711 [2021-01-07 01:42:38,366 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 [2021-01-07 01:42:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11711 states. [2021-01-07 01:42:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11711 to 10863. [2021-01-07 01:42:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2021-01-07 01:42:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 15376 transitions. [2021-01-07 01:42:39,018 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 15376 transitions. Word has length 167 [2021-01-07 01:42:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:39,018 INFO L481 AbstractCegarLoop]: Abstraction has 10863 states and 15376 transitions. [2021-01-07 01:42:39,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 15376 transitions. [2021-01-07 01:42:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-07 01:42:39,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:39,027 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:39,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 01:42:39,027 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1162528673, now seen corresponding path program 1 times [2021-01-07 01:42:39,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:39,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883010049] [2021-01-07 01:42:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-07 01:42:39,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883010049] [2021-01-07 01:42:39,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:39,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:39,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741939319] [2021-01-07 01:42:39,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:39,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:39,252 INFO L87 Difference]: Start difference. First operand 10863 states and 15376 transitions. Second operand 4 states. [2021-01-07 01:42:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:40,356 INFO L93 Difference]: Finished difference Result 32250 states and 45575 transitions. [2021-01-07 01:42:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:40,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-07 01:42:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:40,521 INFO L225 Difference]: With dead ends: 32250 [2021-01-07 01:42:40,521 INFO L226 Difference]: Without dead ends: 21433 [2021-01-07 01:42:40,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21433 states. [2021-01-07 01:42:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21433 to 10879. [2021-01-07 01:42:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10879 states. [2021-01-07 01:42:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10879 states to 10879 states and 15392 transitions. [2021-01-07 01:42:41,327 INFO L78 Accepts]: Start accepts. Automaton has 10879 states and 15392 transitions. Word has length 171 [2021-01-07 01:42:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:41,327 INFO L481 AbstractCegarLoop]: Abstraction has 10879 states and 15392 transitions. [2021-01-07 01:42:41,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 10879 states and 15392 transitions. [2021-01-07 01:42:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-07 01:42:41,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:41,343 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:41,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:42:41,345 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash -260175973, now seen corresponding path program 1 times [2021-01-07 01:42:41,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:41,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389713752] [2021-01-07 01:42:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-01-07 01:42:41,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389713752] [2021-01-07 01:42:41,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:41,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:41,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896587252] [2021-01-07 01:42:41,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:41,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:41,686 INFO L87 Difference]: Start difference. First operand 10879 states and 15392 transitions. Second operand 4 states. [2021-01-07 01:42:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:43,288 INFO L93 Difference]: Finished difference Result 25559 states and 36047 transitions. [2021-01-07 01:42:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:43,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2021-01-07 01:42:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:43,335 INFO L225 Difference]: With dead ends: 25559 [2021-01-07 01:42:43,335 INFO L226 Difference]: Without dead ends: 14670 [2021-01-07 01:42:43,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2021-01-07 01:42:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 10879. [2021-01-07 01:42:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10879 states. [2021-01-07 01:42:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10879 states to 10879 states and 15364 transitions. [2021-01-07 01:42:44,080 INFO L78 Accepts]: Start accepts. Automaton has 10879 states and 15364 transitions. Word has length 181 [2021-01-07 01:42:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:44,081 INFO L481 AbstractCegarLoop]: Abstraction has 10879 states and 15364 transitions. [2021-01-07 01:42:44,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 10879 states and 15364 transitions. [2021-01-07 01:42:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-01-07 01:42:44,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:44,093 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:44,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 01:42:44,094 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2116114487, now seen corresponding path program 1 times [2021-01-07 01:42:44,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:44,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027687005] [2021-01-07 01:42:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-01-07 01:42:44,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027687005] [2021-01-07 01:42:44,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:44,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:44,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781723998] [2021-01-07 01:42:44,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:44,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:44,410 INFO L87 Difference]: Start difference. First operand 10879 states and 15364 transitions. Second operand 3 states. [2021-01-07 01:42:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:45,488 INFO L93 Difference]: Finished difference Result 25533 states and 36131 transitions. [2021-01-07 01:42:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:45,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2021-01-07 01:42:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:45,543 INFO L225 Difference]: With dead ends: 25533 [2021-01-07 01:42:45,543 INFO L226 Difference]: Without dead ends: 14700 [2021-01-07 01:42:45,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14700 states. [2021-01-07 01:42:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14700 to 11383. [2021-01-07 01:42:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2021-01-07 01:42:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 16204 transitions. [2021-01-07 01:42:46,362 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 16204 transitions. Word has length 183 [2021-01-07 01:42:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:46,362 INFO L481 AbstractCegarLoop]: Abstraction has 11383 states and 16204 transitions. [2021-01-07 01:42:46,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 16204 transitions. [2021-01-07 01:42:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-01-07 01:42:46,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:46,373 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:46,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 01:42:46,374 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:46,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1159068790, now seen corresponding path program 1 times [2021-01-07 01:42:46,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:46,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65772440] [2021-01-07 01:42:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-07 01:42:46,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65772440] [2021-01-07 01:42:46,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:46,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:42:46,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847613159] [2021-01-07 01:42:46,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:46,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:46,796 INFO L87 Difference]: Start difference. First operand 11383 states and 16204 transitions. Second operand 5 states. [2021-01-07 01:42:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:49,221 INFO L93 Difference]: Finished difference Result 39967 states and 56443 transitions. [2021-01-07 01:42:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:42:49,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2021-01-07 01:42:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:49,289 INFO L225 Difference]: With dead ends: 39967 [2021-01-07 01:42:49,289 INFO L226 Difference]: Without dead ends: 28630 [2021-01-07 01:42:49,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28630 states. [2021-01-07 01:42:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28630 to 11467. [2021-01-07 01:42:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2021-01-07 01:42:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 16288 transitions. [2021-01-07 01:42:50,007 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 16288 transitions. Word has length 190 [2021-01-07 01:42:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:50,007 INFO L481 AbstractCegarLoop]: Abstraction has 11467 states and 16288 transitions. [2021-01-07 01:42:50,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 16288 transitions. [2021-01-07 01:42:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-07 01:42:50,017 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:50,017 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:50,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 01:42:50,017 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash 573577018, now seen corresponding path program 1 times [2021-01-07 01:42:50,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:50,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960451112] [2021-01-07 01:42:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-07 01:42:50,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960451112] [2021-01-07 01:42:50,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:50,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:42:50,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175894543] [2021-01-07 01:42:50,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:50,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:50,350 INFO L87 Difference]: Start difference. First operand 11467 states and 16288 transitions. Second operand 5 states. [2021-01-07 01:42:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:52,998 INFO L93 Difference]: Finished difference Result 40493 states and 57211 transitions. [2021-01-07 01:42:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:42:52,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2021-01-07 01:42:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:53,082 INFO L225 Difference]: With dead ends: 40493 [2021-01-07 01:42:53,083 INFO L226 Difference]: Without dead ends: 29072 [2021-01-07 01:42:53,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29072 states. [2021-01-07 01:42:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29072 to 11551. [2021-01-07 01:42:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11551 states. [2021-01-07 01:42:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 16372 transitions. [2021-01-07 01:42:53,917 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 16372 transitions. Word has length 192 [2021-01-07 01:42:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:53,917 INFO L481 AbstractCegarLoop]: Abstraction has 11551 states and 16372 transitions. [2021-01-07 01:42:53,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 16372 transitions. [2021-01-07 01:42:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-07 01:42:53,925 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:53,925 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:53,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 01:42:53,925 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:53,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1257674558, now seen corresponding path program 1 times [2021-01-07 01:42:53,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:53,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739220996] [2021-01-07 01:42:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-07 01:42:54,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739220996] [2021-01-07 01:42:54,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:54,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:54,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713320003] [2021-01-07 01:42:54,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:54,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:54,270 INFO L87 Difference]: Start difference. First operand 11551 states and 16372 transitions. Second operand 4 states. [2021-01-07 01:42:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:56,036 INFO L93 Difference]: Finished difference Result 33097 states and 46761 transitions. [2021-01-07 01:42:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:56,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2021-01-07 01:42:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:56,079 INFO L225 Difference]: With dead ends: 33097 [2021-01-07 01:42:56,079 INFO L226 Difference]: Without dead ends: 21592 [2021-01-07 01:42:56,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21592 states. [2021-01-07 01:42:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21592 to 11671. [2021-01-07 01:42:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11671 states. [2021-01-07 01:42:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11671 states to 11671 states and 16522 transitions. [2021-01-07 01:42:56,926 INFO L78 Accepts]: Start accepts. Automaton has 11671 states and 16522 transitions. Word has length 194 [2021-01-07 01:42:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:56,926 INFO L481 AbstractCegarLoop]: Abstraction has 11671 states and 16522 transitions. [2021-01-07 01:42:56,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11671 states and 16522 transitions. [2021-01-07 01:42:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-01-07 01:42:56,933 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:56,933 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:56,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 01:42:56,934 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1647996570, now seen corresponding path program 1 times [2021-01-07 01:42:56,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:56,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752076923] [2021-01-07 01:42:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-01-07 01:42:57,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752076923] [2021-01-07 01:42:57,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:57,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:57,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832891495] [2021-01-07 01:42:57,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:57,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:57,526 INFO L87 Difference]: Start difference. First operand 11671 states and 16522 transitions. Second operand 3 states. [2021-01-07 01:42:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:58,281 INFO L93 Difference]: Finished difference Result 23328 states and 33031 transitions. [2021-01-07 01:42:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:58,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2021-01-07 01:42:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:58,313 INFO L225 Difference]: With dead ends: 23328 [2021-01-07 01:42:58,313 INFO L226 Difference]: Without dead ends: 11673 [2021-01-07 01:42:58,331 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 [2021-01-07 01:42:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11673 states. [2021-01-07 01:42:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11673 to 11673. [2021-01-07 01:42:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11673 states. [2021-01-07 01:42:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 16524 transitions. [2021-01-07 01:42:59,020 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 16524 transitions. Word has length 196 [2021-01-07 01:42:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:59,020 INFO L481 AbstractCegarLoop]: Abstraction has 11673 states and 16524 transitions. [2021-01-07 01:42:59,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 16524 transitions. [2021-01-07 01:42:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-01-07 01:42:59,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:59,030 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:59,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 01:42:59,031 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1633782916, now seen corresponding path program 1 times [2021-01-07 01:42:59,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:59,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224312950] [2021-01-07 01:42:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-01-07 01:42:59,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224312950] [2021-01-07 01:42:59,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687237308] [2021-01-07 01:42:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:01,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 67 conjunts are in the unsatisfiable core [2021-01-07 01:43:01,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:01,546 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-01-07 01:43:01,547 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:43:01,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:01,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:43:01,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 01:43:01,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 01:43:01,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 01:43:01,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:43:01,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 01:43:01,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 01:43:01,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:01,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:43:01,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:43:02,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:02,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:43:02,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:43:02,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:43:02,133 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_268|, |v_#memory_int_269|, |v_#memory_int_271|], 3=[|v_#memory_int_273|], 4=[|v_#memory_int_270|]} [2021-01-07 01:43:02,146 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:02,155 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:02,164 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:02,572 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2021-01-07 01:43:02,573 INFO L625 ElimStorePlain]: treesize reduction 242, result has 29.4 percent of original size [2021-01-07 01:43:02,584 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:02,707 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-07 01:43:02,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:02,714 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:02,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:02,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,915 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-01-07 01:43:02,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:02,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2021-01-07 01:43:02,958 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 01:43:02,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:02,970 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:43:03,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:03,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,012 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2021-01-07 01:43:03,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:43:03,071 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 53 [2021-01-07 01:43:03,076 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 01:43:03,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:03,095 INFO L547 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:43:03,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:43:03,128 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:43:03,129 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:379, output treesize:41 [2021-01-07 01:43:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-01-07 01:43:03,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:43:03,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2021-01-07 01:43:03,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259404557] [2021-01-07 01:43:03,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 01:43:03,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 01:43:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-07 01:43:03,417 INFO L87 Difference]: Start difference. First operand 11673 states and 16524 transitions. Second operand 9 states. [2021-01-07 01:43:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:18,614 INFO L93 Difference]: Finished difference Result 27726 states and 39171 transitions. [2021-01-07 01:43:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 01:43:18,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2021-01-07 01:43:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:18,655 INFO L225 Difference]: With dead ends: 27726 [2021-01-07 01:43:18,655 INFO L226 Difference]: Without dead ends: 16101 [2021-01-07 01:43:18,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-01-07 01:43:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16101 states. [2021-01-07 01:43:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16101 to 11673. [2021-01-07 01:43:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11673 states. [2021-01-07 01:43:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 16516 transitions. [2021-01-07 01:43:19,444 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 16516 transitions. Word has length 198 [2021-01-07 01:43:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:19,445 INFO L481 AbstractCegarLoop]: Abstraction has 11673 states and 16516 transitions. [2021-01-07 01:43:19,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 01:43:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 16516 transitions. [2021-01-07 01:43:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-01-07 01:43:19,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:19,452 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:19,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 01:43:19,653 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash 720602366, now seen corresponding path program 1 times [2021-01-07 01:43:19,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:19,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008127620] [2021-01-07 01:43:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-01-07 01:43:20,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008127620] [2021-01-07 01:43:20,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685696949] [2021-01-07 01:43:20,131 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 [2021-01-07 01:43:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:22,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 2274 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 01:43:22,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-07 01:43:22,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:43:22,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-01-07 01:43:22,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869107432] [2021-01-07 01:43:22,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:22,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:22,780 INFO L87 Difference]: Start difference. First operand 11673 states and 16516 transitions. Second operand 4 states. [2021-01-07 01:43:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:25,062 INFO L93 Difference]: Finished difference Result 23480 states and 33224 transitions. [2021-01-07 01:43:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:25,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2021-01-07 01:43:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:25,094 INFO L225 Difference]: With dead ends: 23480 [2021-01-07 01:43:25,094 INFO L226 Difference]: Without dead ends: 11855 [2021-01-07 01:43:25,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2021-01-07 01:43:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11699. [2021-01-07 01:43:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11699 states. [2021-01-07 01:43:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11699 states to 11699 states and 16542 transitions. [2021-01-07 01:43:25,943 INFO L78 Accepts]: Start accepts. Automaton has 11699 states and 16542 transitions. Word has length 198 [2021-01-07 01:43:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:25,943 INFO L481 AbstractCegarLoop]: Abstraction has 11699 states and 16542 transitions. [2021-01-07 01:43:25,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11699 states and 16542 transitions. [2021-01-07 01:43:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-07 01:43:25,950 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:25,950 INFO L422 BasicCegarLoop]: trace histogram [8, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:26,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 01:43:26,152 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1052196358, now seen corresponding path program 1 times [2021-01-07 01:43:26,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:26,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698353321] [2021-01-07 01:43:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-01-07 01:43:26,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698353321] [2021-01-07 01:43:26,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:26,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:43:26,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655060736] [2021-01-07 01:43:26,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:43:26,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:43:26,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:26,387 INFO L87 Difference]: Start difference. First operand 11699 states and 16542 transitions. Second operand 3 states. [2021-01-07 01:43:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:28,207 INFO L93 Difference]: Finished difference Result 23528 states and 33246 transitions. [2021-01-07 01:43:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:43:28,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2021-01-07 01:43:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:28,242 INFO L225 Difference]: With dead ends: 23528 [2021-01-07 01:43:28,243 INFO L226 Difference]: Without dead ends: 11877 [2021-01-07 01:43:28,263 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 [2021-01-07 01:43:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2021-01-07 01:43:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 11699. [2021-01-07 01:43:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11699 states. [2021-01-07 01:43:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11699 states to 11699 states and 16476 transitions. [2021-01-07 01:43:29,235 INFO L78 Accepts]: Start accepts. Automaton has 11699 states and 16476 transitions. Word has length 201 [2021-01-07 01:43:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:29,236 INFO L481 AbstractCegarLoop]: Abstraction has 11699 states and 16476 transitions. [2021-01-07 01:43:29,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:43:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11699 states and 16476 transitions. [2021-01-07 01:43:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-01-07 01:43:29,245 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:29,245 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:29,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 01:43:29,245 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1787238907, now seen corresponding path program 1 times [2021-01-07 01:43:29,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:29,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549712675] [2021-01-07 01:43:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-07 01:43:29,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549712675] [2021-01-07 01:43:29,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42297756] [2021-01-07 01:43:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:33,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 2283 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:43:33,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-07 01:43:33,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:33,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:43:33,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151824216] [2021-01-07 01:43:33,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:43:33,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:43:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:33,275 INFO L87 Difference]: Start difference. First operand 11699 states and 16476 transitions. Second operand 6 states. [2021-01-07 01:43:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:34,217 INFO L93 Difference]: Finished difference Result 23383 states and 32938 transitions. [2021-01-07 01:43:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:34,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2021-01-07 01:43:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:34,246 INFO L225 Difference]: With dead ends: 23383 [2021-01-07 01:43:34,246 INFO L226 Difference]: Without dead ends: 11701 [2021-01-07 01:43:34,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11701 states. [2021-01-07 01:43:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11701 to 11701. [2021-01-07 01:43:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11701 states. [2021-01-07 01:43:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11701 states to 11701 states and 16478 transitions. [2021-01-07 01:43:34,986 INFO L78 Accepts]: Start accepts. Automaton has 11701 states and 16478 transitions. Word has length 202 [2021-01-07 01:43:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:34,987 INFO L481 AbstractCegarLoop]: Abstraction has 11701 states and 16478 transitions. [2021-01-07 01:43:34,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:43:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11701 states and 16478 transitions. [2021-01-07 01:43:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-07 01:43:34,994 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:34,994 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:35,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:35,196 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1959533603, now seen corresponding path program 2 times [2021-01-07 01:43:35,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:35,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806597885] [2021-01-07 01:43:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-01-07 01:43:35,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806597885] [2021-01-07 01:43:35,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595017744] [2021-01-07 01:43:35,662 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:41,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:43:41,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:43:41,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 2295 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 01:43:41,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:41,511 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2021-01-07 01:43:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-01-07 01:43:41,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:41,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:43:41,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065307905] [2021-01-07 01:43:41,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:43:41,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:43:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:43:41,627 INFO L87 Difference]: Start difference. First operand 11701 states and 16478 transitions. Second operand 8 states. [2021-01-07 01:43:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:42,402 INFO L93 Difference]: Finished difference Result 23386 states and 32941 transitions. [2021-01-07 01:43:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:43:42,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2021-01-07 01:43:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:42,434 INFO L225 Difference]: With dead ends: 23386 [2021-01-07 01:43:42,434 INFO L226 Difference]: Without dead ends: 11703 [2021-01-07 01:43:42,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:43:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2021-01-07 01:43:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 11703. [2021-01-07 01:43:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11703 states. [2021-01-07 01:43:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11703 states to 11703 states and 16480 transitions. [2021-01-07 01:43:43,143 INFO L78 Accepts]: Start accepts. Automaton has 11703 states and 16480 transitions. Word has length 204 [2021-01-07 01:43:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:43,144 INFO L481 AbstractCegarLoop]: Abstraction has 11703 states and 16480 transitions. [2021-01-07 01:43:43,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:43:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11703 states and 16480 transitions. [2021-01-07 01:43:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-01-07 01:43:43,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:43,155 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:43,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 01:43:43,371 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -760957051, now seen corresponding path program 3 times [2021-01-07 01:43:43,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:43,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298725150] [2021-01-07 01:43:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-07 01:43:43,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298725150] [2021-01-07 01:43:43,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451196564] [2021-01-07 01:43:43,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:44:28,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 01:44:28,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:44:28,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-07 01:44:28,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:44:28,627 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-01-07 01:44:28,628 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:44:28,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:44:28,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:44:28,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2021-01-07 01:44:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-07 01:44:28,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:44:28,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-07 01:44:28,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324646449] [2021-01-07 01:44:28,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:44:28,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:44:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:44:28,796 INFO L87 Difference]: Start difference. First operand 11703 states and 16480 transitions. Second operand 10 states. [2021-01-07 01:44:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:44:29,533 INFO L93 Difference]: Finished difference Result 23389 states and 32944 transitions. [2021-01-07 01:44:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:44:29,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2021-01-07 01:44:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:44:29,563 INFO L225 Difference]: With dead ends: 23389 [2021-01-07 01:44:29,563 INFO L226 Difference]: Without dead ends: 11705 [2021-01-07 01:44:29,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-01-07 01:44:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11705 states. [2021-01-07 01:44:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11705 to 11705. [2021-01-07 01:44:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11705 states. [2021-01-07 01:44:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11705 states to 11705 states and 16482 transitions. [2021-01-07 01:44:30,401 INFO L78 Accepts]: Start accepts. Automaton has 11705 states and 16482 transitions. Word has length 206 [2021-01-07 01:44:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:44:30,401 INFO L481 AbstractCegarLoop]: Abstraction has 11705 states and 16482 transitions. [2021-01-07 01:44:30,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:44:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 11705 states and 16482 transitions. [2021-01-07 01:44:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-01-07 01:44:30,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:44:30,409 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:44:30,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:44:30,610 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:44:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:44:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -443013597, now seen corresponding path program 4 times [2021-01-07 01:44:30,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:44:30,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111970442] [2021-01-07 01:44:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:44:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-07 01:44:31,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111970442] [2021-01-07 01:44:31,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534315865] [2021-01-07 01:44:31,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-01-07 01:44:35,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 01:44:35,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:44:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-07 01:44:35,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:44:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-01-07 01:44:36,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:44:36,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2021-01-07 01:44:36,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161962077] [2021-01-07 01:44:36,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:44:36,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:44:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:44:36,038 INFO L87 Difference]: Start difference. First operand 11705 states and 16482 transitions. Second operand 6 states. [2021-01-07 01:44:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:44:40,271 INFO L93 Difference]: Finished difference Result 39444 states and 55311 transitions. [2021-01-07 01:44:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 01:44:40,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2021-01-07 01:44:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:44:40,336 INFO L225 Difference]: With dead ends: 39444 [2021-01-07 01:44:40,336 INFO L226 Difference]: Without dead ends: 27793 [2021-01-07 01:44:40,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-01-07 01:44:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27793 states. [2021-01-07 01:44:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27793 to 11615. [2021-01-07 01:44:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11615 states. [2021-01-07 01:44:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11615 states to 11615 states and 16355 transitions. [2021-01-07 01:44:41,229 INFO L78 Accepts]: Start accepts. Automaton has 11615 states and 16355 transitions. Word has length 208 [2021-01-07 01:44:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:44:41,230 INFO L481 AbstractCegarLoop]: Abstraction has 11615 states and 16355 transitions. [2021-01-07 01:44:41,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:44:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11615 states and 16355 transitions. [2021-01-07 01:44:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-01-07 01:44:41,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:44:41,245 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:44:41,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:44:41,446 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:44:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:44:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash -740811711, now seen corresponding path program 1 times [2021-01-07 01:44:41,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:44:41,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437669993] [2021-01-07 01:44:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:44:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:41,855 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-01-07 01:44:41,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-01-07 01:44:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-07 01:44:41,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437669993] [2021-01-07 01:44:41,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:44:41,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:44:41,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726583759] [2021-01-07 01:44:41,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:44:41,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:44:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:44:41,930 INFO L87 Difference]: Start difference. First operand 11615 states and 16355 transitions. Second operand 4 states. [2021-01-07 01:44:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:44:46,880 INFO L93 Difference]: Finished difference Result 23536 states and 33753 transitions. [2021-01-07 01:44:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:44:46,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2021-01-07 01:44:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:44:46,932 INFO L225 Difference]: With dead ends: 23536 [2021-01-07 01:44:46,932 INFO L226 Difference]: Without dead ends: 11975 [2021-01-07 01:44:46,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:44:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11975 states. [2021-01-07 01:44:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11975 to 11804. [2021-01-07 01:44:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11804 states. [2021-01-07 01:44:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11804 states to 11804 states and 16559 transitions. [2021-01-07 01:44:47,762 INFO L78 Accepts]: Start accepts. Automaton has 11804 states and 16559 transitions. Word has length 227 [2021-01-07 01:44:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:44:47,763 INFO L481 AbstractCegarLoop]: Abstraction has 11804 states and 16559 transitions. [2021-01-07 01:44:47,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:44:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11804 states and 16559 transitions. [2021-01-07 01:44:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-01-07 01:44:47,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:44:47,780 INFO L422 BasicCegarLoop]: trace histogram [9, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:44:47,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-07 01:44:47,780 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:44:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:44:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -904661899, now seen corresponding path program 1 times [2021-01-07 01:44:47,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:44:47,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879620432] [2021-01-07 01:44:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:44:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:49,023 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-01-07 01:44:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 80 proven. 37 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-01-07 01:44:50,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879620432] [2021-01-07 01:44:50,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44434439] [2021-01-07 01:44:50,433 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 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 [2021-01-07 01:44:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:51,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 01:44:51,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:44:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-07 01:44:51,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:44:51,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [29] total 31 [2021-01-07 01:44:51,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726900811] [2021-01-07 01:44:51,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:44:51,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:44:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2021-01-07 01:44:51,429 INFO L87 Difference]: Start difference. First operand 11804 states and 16559 transitions. Second operand 4 states. [2021-01-07 01:44:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:44:54,101 INFO L93 Difference]: Finished difference Result 30439 states and 42662 transitions. [2021-01-07 01:44:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:44:54,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2021-01-07 01:44:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:44:54,159 INFO L225 Difference]: With dead ends: 30439 [2021-01-07 01:44:54,159 INFO L226 Difference]: Without dead ends: 18689 [2021-01-07 01:44:54,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 239 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-01-07 01:44:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states. [2021-01-07 01:44:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 11804. [2021-01-07 01:44:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11804 states. [2021-01-07 01:44:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11804 states to 11804 states and 16559 transitions. [2021-01-07 01:44:55,344 INFO L78 Accepts]: Start accepts. Automaton has 11804 states and 16559 transitions. Word has length 229 [2021-01-07 01:44:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:44:55,345 INFO L481 AbstractCegarLoop]: Abstraction has 11804 states and 16559 transitions. [2021-01-07 01:44:55,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:44:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 11804 states and 16559 transitions. [2021-01-07 01:44:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-07 01:44:55,359 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:44:55,359 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:44:55,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 01:44:55,575 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:44:55,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:44:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1216808467, now seen corresponding path program 1 times [2021-01-07 01:44:55,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:44:55,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074195790] [2021-01-07 01:44:55,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:44:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:55,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-01-07 01:44:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-07 01:44:55,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074195790] [2021-01-07 01:44:55,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:44:55,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:44:55,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981342970] [2021-01-07 01:44:55,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:44:55,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:44:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:44:55,912 INFO L87 Difference]: Start difference. First operand 11804 states and 16559 transitions. Second operand 4 states. [2021-01-07 01:45:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:45:00,477 INFO L93 Difference]: Finished difference Result 23095 states and 32847 transitions. [2021-01-07 01:45:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:45:00,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2021-01-07 01:45:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:45:00,518 INFO L225 Difference]: With dead ends: 23095 [2021-01-07 01:45:00,518 INFO L226 Difference]: Without dead ends: 11345 [2021-01-07 01:45:00,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:45:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11345 states. [2021-01-07 01:45:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11345 to 11174. [2021-01-07 01:45:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2021-01-07 01:45:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 15389 transitions. [2021-01-07 01:45:01,682 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 15389 transitions. Word has length 232 [2021-01-07 01:45:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:45:01,682 INFO L481 AbstractCegarLoop]: Abstraction has 11174 states and 15389 transitions. [2021-01-07 01:45:01,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:45:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 15389 transitions. [2021-01-07 01:45:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 01:45:01,699 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:45:01,700 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:45:01,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-07 01:45:01,700 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:45:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:45:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1581764285, now seen corresponding path program 1 times [2021-01-07 01:45:01,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:45:01,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883113934] [2021-01-07 01:45:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:45:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:45:01,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-01-07 01:45:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:45:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-07 01:45:02,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883113934] [2021-01-07 01:45:02,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:45:02,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:45:02,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584413684] [2021-01-07 01:45:02,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:45:02,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:45:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:45:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:45:02,011 INFO L87 Difference]: Start difference. First operand 11174 states and 15389 transitions. Second operand 4 states. [2021-01-07 01:45:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:45:06,493 INFO L93 Difference]: Finished difference Result 22375 states and 31467 transitions. [2021-01-07 01:45:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:45:06,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2021-01-07 01:45:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:45:06,536 INFO L225 Difference]: With dead ends: 22375 [2021-01-07 01:45:06,536 INFO L226 Difference]: Without dead ends: 11255 [2021-01-07 01:45:06,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:45:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11255 states. [2021-01-07 01:45:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11255 to 11084. [2021-01-07 01:45:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11084 states. [2021-01-07 01:45:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 15239 transitions. [2021-01-07 01:45:07,679 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 15239 transitions. Word has length 234 [2021-01-07 01:45:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:45:07,680 INFO L481 AbstractCegarLoop]: Abstraction has 11084 states and 15239 transitions. [2021-01-07 01:45:07,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:45:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 15239 transitions. [2021-01-07 01:45:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 01:45:07,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:45:07,689 INFO L422 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:45:07,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-07 01:45:07,689 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:45:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:45:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2139568203, now seen corresponding path program 1 times [2021-01-07 01:45:07,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:45:07,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755525317] [2021-01-07 01:45:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:45:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:45:07,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-01-07 01:45:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:45:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-07 01:45:07,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755525317] [2021-01-07 01:45:07,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:45:07,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:45:07,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109373288] [2021-01-07 01:45:07,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:45:07,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:45:07,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:45:07,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:45:07,953 INFO L87 Difference]: Start difference. First operand 11084 states and 15239 transitions. Second operand 4 states. [2021-01-07 01:45:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:45:12,684 INFO L93 Difference]: Finished difference Result 22315 states and 31317 transitions. [2021-01-07 01:45:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:45:12,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2021-01-07 01:45:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:45:12,709 INFO L225 Difference]: With dead ends: 22315 [2021-01-07 01:45:12,709 INFO L226 Difference]: Without dead ends: 11285 [2021-01-07 01:45:12,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:45:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11285 states. [2021-01-07 01:45:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11285 to 11084. [2021-01-07 01:45:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11084 states. [2021-01-07 01:45:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 15149 transitions. [2021-01-07 01:45:13,769 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 15149 transitions. Word has length 234 [2021-01-07 01:45:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:45:13,769 INFO L481 AbstractCegarLoop]: Abstraction has 11084 states and 15149 transitions. [2021-01-07 01:45:13,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:45:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 15149 transitions. [2021-01-07 01:45:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 01:45:13,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:45:13,780 INFO L422 BasicCegarLoop]: trace histogram [9, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:45:13,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-07 01:45:13,780 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:45:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:45:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1994489594, now seen corresponding path program 1 times [2021-01-07 01:45:13,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:45:13,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723358665] [2021-01-07 01:45:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:45:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat